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 listApr 23, 2026 20:32Charles CabergsCharles CabergsScore: 4,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 20:334,68361,343,59237,398,0001,010,0002,351,104
2Apr 23, 2026 20:334,68659,214,55136,411,0002,022,0002,355,200
3Apr 23, 2026 20:334,70255,524,88337,546,0001,014,0002,347,008
4Apr 23, 2026 20:334,72159,140,54636,683,0002,037,0002,351,104
5Apr 23, 2026 20:334,72957,405,26035,799,0002,983,0002,355,200
6Apr 23, 2026 20:339,60797,236,20874,792,0003,988,0002,371,584
7Apr 23, 2026 20:339,63395,577,04675,995,0002,999,0002,363,392
8Apr 23, 2026 20:339,636101,276,83274,017,0005,001,0002,347,008
9Apr 23, 2026 20:339,66795,216,94375,261,0004,013,0002,379,776