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 listJun 12, 2026 11:40Victor MerckléVictor MerckléScore: 3,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 11:413,31434,627,23026,136,0001,043,0002,113,536
2Jun 12, 2026 11:413,32234,752,73526,178,0001,063,0002,113,536
3Jun 12, 2026 11:413,33434,767,56526,303,0001,040,0002,113,536
4Jun 12, 2026 11:413,35334,943,98526,435,0001,062,0002,113,536
5Jun 12, 2026 11:413,37635,132,31526,657,0001,032,0002,113,536
6Jun 12, 2026 11:413,37735,094,97726,628,0001,068,0002,113,536
7Jun 12, 2026 11:413,41135,523,32026,923,0001,051,0002,113,536
8Jun 12, 2026 11:413,41835,462,87226,961,0001,069,0002,113,536
9Jun 12, 2026 11:4112,993113,955,673104,512,0002,034,0002,113,536