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 21:36Josu San MartinJosu San MartinScore: 11,305Success
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 21:363,60551,112,39828,545,0001,019,0002,330,624
2Mar 12, 2026 21:3611,305120,074,32290,706,0001,993,0002,523,136
3Mar 12, 2026 21:3611,359115,900,59392,140,0001,001,0002,289,664