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 28, 2026 13:58Dominique GarmierDominique GarmierScore: 39,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 13:5838,512343,155,472311,805,0003,997,0002,273,280
2Mar 28, 2026 13:5839,347348,014,802319,646,0002,996,0002,367,488
3Mar 28, 2026 13:5840,386356,058,204326,162,0005,002,0002,506,752