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 1, 2026 17:55Pavel SkripkinPavel SkripkinScore: 12,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:5612,829122,822,806101,193,0004,007,0002,428,928
2May 1, 2026 17:5612,857122,541,756101,416,0004,016,0002,424,832
3May 1, 2026 17:5612,872122,545,225103,541,0002,010,0002,420,736
4May 1, 2026 17:5612,875124,322,205101,560,0004,022,0002,428,928
5May 1, 2026 17:5612,876117,982,233102,574,0003,016,0002,330,624
6May 1, 2026 17:5612,898120,821,857102,775,0002,993,0002,420,736
7May 1, 2026 17:5612,907125,091,423100,847,0004,992,0002,420,736
8May 1, 2026 17:5612,916121,696,840101,923,0003,996,0002,424,832
9May 1, 2026 17:5612,966120,104,443104,320,0002,006,0002,424,832