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 listJun 19, 2026 17:23Victor MerckléVictor MerckléScore: 3,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:233,32535,009,03526,242,0001,029,0002,113,536
2Jun 19, 2026 17:233,33934,824,86526,341,0001,040,0002,113,536
3Jun 19, 2026 17:233,35134,881,75526,429,0001,057,0002,113,536
4Jun 19, 2026 17:233,35635,137,07626,462,0001,059,0002,113,536
5Jun 19, 2026 17:233,36235,137,09126,533,0001,042,0002,113,536
6Jun 19, 2026 17:233,36435,333,37526,544,0001,048,0002,113,536
7Jun 19, 2026 17:233,37335,054,20626,608,0001,055,0002,113,536
8Jun 19, 2026 17:233,40835,675,07826,877,0001,073,0002,113,536
9Jun 19, 2026 17:236,33559,408,73550,916,0001,038,0002,113,536