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 13:01Josu San MartinJosu San MartinScore: 3,342Success
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 13:043,30637,171,94826,062,0001,053,0002,113,536
2Sep 3, 2026 13:043,31937,281,98926,170,0001,049,0002,113,536
3Sep 3, 2026 13:043,32137,353,61326,165,0001,068,0002,113,536
4Sep 3, 2026 13:043,32437,240,42126,212,0001,049,0002,113,536
5Sep 3, 2026 13:043,34237,484,73326,333,0001,072,0002,113,536
6Sep 3, 2026 13:043,34237,466,45326,328,0001,081,0002,113,536
7Sep 3, 2026 13:043,35538,189,57726,442,0001,076,0002,113,536
8Sep 3, 2026 13:043,39737,895,63426,805,0001,057,0002,113,536
9Sep 3, 2026 13:0414,751131,024,517119,916,0001,049,0002,113,536