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 8, 2026 07:56Victor MerckléVictor MerckléScore: 5,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:573,24434,927,03921,032,0005,570,00024,576stderr
2Sep 8, 2026 07:573,86140,006,00521,615,00010,052,00024,576stderr
3Sep 8, 2026 07:574,14042,268,68721,315,00012,640,00024,576stderr
4Sep 8, 2026 07:574,59845,886,23221,420,00016,284,00024,576stderr
5Sep 8, 2026 07:575,96057,228,05343,116,0005,757,00024,576stderr
6Sep 8, 2026 07:576,37460,623,72043,252,0009,021,00024,576stderr
7Sep 8, 2026 07:576,42061,011,40643,209,0009,437,00024,576stderr
8Sep 8, 2026 07:576,48361,503,33843,150,00010,018,00024,576stderr
9Sep 8, 2026 07:5710,36493,285,62876,877,0008,109,00024,576stderr