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 3, 2026 05:01Josu San MartinJosu San MartinScore: 192,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 05:01182,7054,513,855,285470,300,0001,027,883,000331,776
2Mar 3, 2026 05:01192,2914,721,704,705567,038,0001,009,752,000274,432
3Mar 3, 2026 05:01193,8694,826,433,386552,179,0001,037,546,000196,608