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 listApr 30, 2026 08:06Victor MerckléVictor MerckléScore: 87,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 08:0787,285737,591,853712,744,0002,998,0002,375,680stderr
2Apr 30, 2026 08:0787,303734,603,472712,893,0002,999,0002,506,752stderr
3Apr 30, 2026 08:0787,326736,298,841713,078,0003,000,0002,318,336stderr
4Apr 30, 2026 08:0787,457737,763,774714,148,0003,000,0002,494,464stderr
5Apr 30, 2026 08:0787,645739,668,819714,692,0003,998,0002,482,176stderr
6Apr 30, 2026 08:0787,680737,478,981716,978,0001,999,0002,449,408stderr
7Apr 30, 2026 08:0787,992743,845,837718,539,0002,998,0002,437,120stderr
8Apr 30, 2026 08:0788,278743,643,647720,888,0002,999,0002,330,624stderr
9Apr 30, 2026 08:0788,552742,509,965725,131,0001,000,0002,560,000stderr