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 3, 2026 17:03Josu San MartinJosu San MartinScore: 3,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:043,32637,339,27626,220,0001,061,0002,113,536
2Sep 3, 2026 17:043,33937,556,68626,327,0001,057,0002,113,536
3Sep 3, 2026 17:043,34237,427,27926,357,0001,054,0002,113,536
4Sep 3, 2026 17:043,34337,835,74526,365,0001,054,0002,113,536
5Sep 3, 2026 17:043,34538,282,55026,342,0001,088,0002,113,536
6Sep 3, 2026 17:043,39540,040,79626,746,0001,098,0002,113,536
7Sep 3, 2026 17:0415,647139,187,494127,238,0001,072,0002,113,536
8Sep 3, 2026 17:0415,647138,369,820127,248,0001,059,0002,113,536
9Sep 3, 2026 17:0415,658138,475,971127,365,0001,033,0002,113,536