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 12:13Victor MerckléVictor MerckléScore: 2,952Success
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 12:142,90032,068,73922,757,0001,025,0002,117,632stderr
2Sep 1, 2026 12:142,91732,147,55822,806,0001,121,0002,117,632stderr
3Sep 1, 2026 12:142,91832,154,80322,907,0001,024,0002,117,632stderr
4Sep 1, 2026 12:142,92632,089,37522,872,0001,123,0002,117,632stderr
5Sep 1, 2026 12:142,95233,377,56223,154,0001,055,0002,117,632stderr
6Sep 1, 2026 12:142,96933,450,78823,276,0001,070,0002,117,632stderr
7Sep 1, 2026 12:142,98032,635,00723,387,0001,054,0002,117,632stderr
8Sep 1, 2026 12:145,63154,371,81345,165,0001,017,0002,117,632stderr
9Sep 1, 2026 12:145,64854,497,68045,299,0001,018,0002,117,632stderr