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 05:43Josu San MartinJosu San MartinScore: 11,409Success
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 05:443,34537,975,83326,375,0001,062,0002,117,632
2Sep 3, 2026 05:443,35037,609,97226,410,0001,060,0002,117,632
3Sep 3, 2026 05:443,36537,643,01526,521,0001,072,0002,117,632
4Sep 3, 2026 05:4411,388103,368,48192,375,0001,010,0002,117,632
5Sep 3, 2026 05:4411,409103,597,86791,517,0002,040,0002,117,632
6Sep 3, 2026 05:4411,463103,880,93891,966,0002,038,0002,117,632
7Sep 3, 2026 05:4411,466104,672,76791,965,0002,061,0002,117,632
8Sep 3, 2026 05:4411,469104,118,29192,042,0002,008,0002,117,632
9Sep 3, 2026 05:4411,472104,120,43791,976,0002,098,0002,117,632