Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listApr 24, 2026 07:20olliecrowolliecrowScore: 23,245Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 07:203,39049,974,62123,834,0003,972,0002,482,176
2Apr 24, 2026 07:203,40944,243,80925,962,0001,997,0002,371,584
3Apr 24, 2026 07:203,42144,612,01224,052,0004,008,0002,461,696
4Apr 24, 2026 07:2023,227207,847,882185,451,0005,012,0002,486,272
5Apr 24, 2026 07:2023,245210,499,074185,627,0004,989,0002,420,736
6Apr 24, 2026 07:2023,275210,644,238185,866,0004,996,0002,424,832
7Apr 24, 2026 07:2023,294211,479,285186,014,0005,000,0002,564,096
8Apr 24, 2026 07:2023,300208,390,331187,062,0004,001,0002,441,216
9Apr 24, 2026 07:2023,374214,587,270187,674,0003,993,0002,367,488