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 listMay 21, 2026 23:43M-RochatM-RochatScore: 18,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:446,92066,184,46453,724,0003,028,0002,113,536
2May 21, 2026 23:446,93566,301,83053,775,0003,095,0002,113,536
3May 21, 2026 23:447,13970,446,09055,530,0003,012,0002,113,536
4May 21, 2026 23:4418,915164,469,099152,093,0003,017,0002,117,632
5May 21, 2026 23:4418,980167,788,768152,620,0003,018,0002,117,632
6May 21, 2026 23:4419,023167,036,577152,977,0003,016,0002,117,632
7May 21, 2026 23:4419,074166,569,975153,394,0003,020,0002,117,632
8May 21, 2026 23:4419,200166,795,135154,428,0003,019,0002,113,536
9May 21, 2026 23:4419,247167,141,655153,803,0004,027,0002,117,632