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 listApr 27, 2026 20:53Victor MerckléVictor MerckléScore: 283,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 20:53280,2662,316,994,3882,166,288,000131,895,0002,543,616stderr
2Apr 27, 2026 20:53283,5222,345,560,7942,194,002,000130,880,0002,547,712stderr
3Apr 27, 2026 20:53292,1272,414,462,0902,267,527,000127,916,0002,527,232stderr