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 listSep 4, 2026 06:55Josu San MartinJosu San MartinScore: 3,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:563,04334,924,13723,923,0001,037,0002,121,728stderr
2Sep 4, 2026 06:563,05435,796,77424,020,0001,027,0002,121,728stderr
3Sep 4, 2026 06:563,06535,204,38124,115,0001,025,0002,121,728stderr
4Sep 4, 2026 06:563,06835,130,73524,115,0001,047,0002,121,728stderr
5Sep 4, 2026 06:563,07535,166,15124,179,0001,036,0002,121,728stderr
6Sep 4, 2026 06:563,08035,166,82224,232,0001,026,0002,121,728stderr
7Sep 4, 2026 06:5615,225134,829,241123,839,0001,006,0002,121,728stderr
8Sep 4, 2026 06:5615,294136,127,857124,403,0001,011,0002,121,728stderr
9Sep 4, 2026 06:5615,334135,653,513124,725,0001,016,0002,121,728stderr