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 18:31Josu San MartinJosu San MartinScore: 3,240Success
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 18:323,21636,318,39325,182,0001,197,0002,117,632
2Sep 3, 2026 18:323,22536,376,93425,248,0001,202,0002,117,632
3Sep 3, 2026 18:323,22736,446,65825,358,0001,108,0002,117,632
4Sep 3, 2026 18:323,23636,473,26025,334,0001,204,0002,117,632
5Sep 3, 2026 18:323,24036,557,83525,371,0001,204,0002,117,632
6Sep 3, 2026 18:323,24336,486,01825,397,0001,200,0002,117,632
7Sep 3, 2026 18:3215,407136,352,355125,240,0001,103,0002,117,632
8Sep 3, 2026 18:3215,453136,688,320125,712,0001,007,0002,117,632
9Sep 3, 2026 18:3215,561137,574,407126,595,0001,011,0002,117,632