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 12, 2026 16:19Josu San MartinJosu San MartinScore: 15,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 16:1914,517139,214,743118,038,0001,000,0002,461,696
2Mar 12, 2026 16:1915,097149,716,594122,800,000998,0002,461,696
3Mar 12, 2026 16:1915,193150,077,200123,582,0001,004,0002,449,408