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 listMar 4, 2026 05:52olliecrowolliecrowScore: 12,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:5212,168127,171,03797,785,0001,995,0002,412,544
2Mar 4, 2026 05:5212,173138,237,69497,824,0001,996,0002,441,216
3Mar 4, 2026 05:5212,228136,324,07698,268,0002,005,0002,355,200