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 listSep 1, 2026 10:16Victor MerckléVictor MerckléScore: 2,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:172,71530,743,19121,149,0001,120,0002,117,632stderr
2Sep 1, 2026 10:172,72430,671,42321,215,0001,122,0002,117,632stderr
3Sep 1, 2026 10:172,73430,679,47421,305,0001,114,0002,117,632stderr
4Sep 1, 2026 10:172,73430,593,08321,412,0001,013,0002,117,632stderr
5Sep 1, 2026 10:172,73930,799,74221,394,0001,066,0002,117,632stderr
6Sep 1, 2026 10:172,74230,667,66621,407,0001,085,0002,117,632stderr
7Sep 1, 2026 10:172,74430,744,54121,436,0001,070,0002,117,632stderr
8Sep 1, 2026 10:175,40952,635,43943,344,0001,013,0002,117,632stderr
9Sep 1, 2026 10:175,43753,574,02243,570,0001,015,0002,117,632stderr