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 listMay 11, 2026 20:02Victor MerckléVictor MerckléScore: 3,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:023,43936,955,40227,142,0001,059,0002,113,536
2May 11, 2026 20:023,47940,732,82127,480,0001,048,0002,113,536
3May 11, 2026 20:023,49038,989,32027,591,0001,031,0002,113,536
4May 11, 2026 20:023,51639,517,30327,781,0001,055,0002,113,536
5May 11, 2026 20:023,51739,312,67027,806,0001,035,0002,113,536
6May 11, 2026 20:0212,898116,735,084103,572,0002,196,0002,113,536
7May 11, 2026 20:0212,938116,858,457103,870,0002,228,0002,113,536
8May 11, 2026 20:0213,652123,547,785109,922,0002,032,0002,113,536
9May 11, 2026 20:0213,683123,175,140109,945,0002,257,0002,113,536