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 listJul 9, 2026 18:04Victor MerckléVictor MerckléScore: 11,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 18:052,90031,732,09122,767,0001,021,0002,117,632stderr
2Jul 9, 2026 18:052,90431,916,66422,777,0001,036,0002,117,632stderr
3Jul 9, 2026 18:052,90431,792,76322,682,0001,137,0002,117,632stderr
4Jul 9, 2026 18:052,97832,355,05523,408,0001,016,0002,117,632stderr
5Jul 9, 2026 18:0511,734104,230,22295,110,0001,114,0002,117,632stderr
6Jul 9, 2026 18:0511,838105,072,29995,940,0001,132,0002,117,632stderr
7Jul 9, 2026 18:0511,860105,273,83896,118,0001,139,0002,117,632stderr
8Jul 9, 2026 18:0512,171108,294,97998,662,0001,147,0002,117,632stderr
9Jul 9, 2026 18:0512,263109,043,76099,556,0001,007,0002,117,632stderr