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 22:32Josu San MartinJosu San MartinScore: 3,255Success
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 22:333,23837,318,78025,534,0001,025,0002,121,728stderr
2Sep 3, 2026 22:333,24236,513,29725,539,0001,053,0002,121,728stderr
3Sep 3, 2026 22:333,24836,568,58825,608,0001,027,0002,121,728stderr
4Sep 3, 2026 22:333,25336,646,14125,645,0001,034,0002,121,728stderr
5Sep 3, 2026 22:333,25537,427,41325,667,0001,032,0002,121,728stderr
6Sep 3, 2026 22:333,25636,707,92725,682,0001,023,0002,121,728stderr
7Sep 3, 2026 22:333,29737,124,35426,017,0001,024,0002,121,728stderr
8Sep 3, 2026 22:333,33337,360,07326,313,0001,023,0002,121,728stderr
9Sep 3, 2026 22:3315,408136,344,813125,340,0001,007,0002,121,728stderr