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 13:01Victor MerckléVictor MerckléScore: 2,642Success
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 13:032,63029,940,99020,549,0001,022,0002,117,632stderr
2Sep 1, 2026 13:032,63129,941,77420,545,0001,031,0002,117,632stderr
3Sep 1, 2026 13:032,63730,037,85120,603,0001,024,0002,117,632stderr
4Sep 1, 2026 13:032,63829,996,56620,607,0001,028,0002,117,632stderr
5Sep 1, 2026 13:032,64230,084,00920,588,0001,083,0002,117,632stderr
6Sep 1, 2026 13:032,64530,042,80420,671,0001,026,0002,117,632stderr
7Sep 1, 2026 13:035,29851,784,66042,424,0001,023,0002,117,632stderr
8Sep 1, 2026 13:035,31951,958,05742,409,0001,213,0002,117,632stderr
9Sep 1, 2026 13:035,33852,143,24542,756,0001,022,0002,117,632stderr