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 listAug 17, 2026 01:33Victor MerckléVictor MerckléScore: 29,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 01:4228,962245,825,287236,469,0001,020,0002,117,632stderr
2Aug 17, 2026 01:4228,988246,028,995236,699,0001,005,0002,117,632stderr
3Aug 17, 2026 01:4228,990246,072,947236,713,0001,013,0002,117,632stderr
4Aug 17, 2026 01:4229,023248,509,048236,963,0001,027,0002,117,632stderr
5Aug 17, 2026 01:4229,636251,392,150241,891,0001,129,0002,117,632stderr
6Aug 17, 2026 01:4237,897319,119,086309,709,0001,050,0002,117,632stderr
7Aug 17, 2026 01:4237,945319,514,958310,115,0001,035,0002,117,632stderr
8Aug 17, 2026 01:4238,023320,171,484310,620,0001,175,0002,117,632stderr
9Aug 17, 2026 01:4238,360322,981,088313,420,0001,138,0002,117,632stderr