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 16, 2026 20:00M-RochatM-RochatScore: 19,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 20:1818,518160,661,400150,844,0001,005,0002,113,536
2May 16, 2026 20:1818,769162,592,755152,907,0001,004,0002,113,536
3May 16, 2026 20:1818,921163,911,298154,149,0001,004,0002,113,536
4May 16, 2026 20:1818,933164,073,469154,254,0001,004,0002,113,536
5May 16, 2026 20:1819,150165,981,552156,034,0001,004,0002,113,536
6May 16, 2026 20:1819,154165,977,483156,061,0001,005,0002,113,536
7May 16, 2026 20:1819,212168,178,389156,537,0001,004,0002,113,536
8May 16, 2026 20:1819,535169,045,704159,186,0001,005,0002,113,536
9May 16, 2026 20:1819,572172,318,395159,488,0001,006,0002,113,536