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 12, 2026 20:26SparkyRobinSparkyRobinScore: 1,005,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 20:27997,6118,190,879,4378,027,086,000153,328,0002,113,536
2Sep 12, 2026 20:271,005,6928,258,272,3588,097,690,000148,988,0002,113,536
3Sep 12, 2026 20:271,007,5868,272,651,7808,110,222,000151,988,0002,113,536