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 3, 2026 17:18Josu San MartinJosu San MartinScore: 3,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:193,24636,501,49725,414,0001,205,0002,117,632
2Sep 3, 2026 17:193,24636,530,11825,418,0001,202,0002,117,632
3Sep 3, 2026 17:193,25536,650,86625,404,0001,291,0002,117,632
4Sep 3, 2026 17:193,26337,461,41425,723,0001,035,0002,117,632
5Sep 3, 2026 17:193,26436,742,91725,740,0001,025,0002,117,632
6Sep 3, 2026 17:193,26536,746,18225,578,0001,195,0002,117,632
7Sep 3, 2026 17:193,27037,543,09225,792,0001,030,0002,117,632
8Sep 3, 2026 17:1915,330135,614,253124,700,0001,007,0002,117,632
9Sep 3, 2026 17:1915,355136,695,506124,899,0001,015,0002,117,632