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 22, 2026 08:11olliecrowolliecrowScore: 22,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 08:123,35344,418,40926,477,0001,018,0002,424,832
2Apr 22, 2026 08:123,35542,255,13827,515,00002,482,176
3Apr 22, 2026 08:123,36348,266,91326,560,0001,021,0002,441,216
4Apr 22, 2026 08:123,37941,218,44126,683,0001,026,0002,314,240
5Apr 22, 2026 08:1222,802206,081,727182,982,0003,999,0002,322,432
6Apr 22, 2026 08:1222,810202,077,244185,045,0002,000,0002,379,776
7Apr 22, 2026 08:1222,848204,478,449186,359,0001,001,0002,347,008
8Apr 22, 2026 08:1222,848203,773,264184,350,0003,005,0002,424,832
9Apr 22, 2026 08:1222,886209,336,681183,676,0003,992,0002,318,336