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:05Pavel SkripkinPavel SkripkinError
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:060116,413,29499,604,0001,006,0002,424,832expected "2233165202 ", got "2258129175 "
2May 1, 2026 17:0612,248119,557,79099,435,0001,004,0002,420,736
3May 1, 2026 17:0612,248118,047,46499,430,0001,004,0002,318,336
4May 1, 2026 17:0612,257117,261,47599,504,0001,005,0002,420,736
5May 1, 2026 17:0612,262116,614,67699,549,0001,005,0002,289,664
6May 1, 2026 17:0612,273121,129,01899,637,0001,006,0002,412,544
7May 1, 2026 17:0612,285114,064,94297,747,0002,992,0002,326,528
8May 1, 2026 17:0612,291121,167,39498,798,0001,995,0002,420,736
9May 1, 2026 17:0612,305121,108,65998,910,0001,998,0002,420,736