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 listJul 8, 2026 12:08Victor MerckléVictor MerckléScore: 2,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:092,87831,605,92622,455,0001,148,0002,117,632stderr
2Jul 8, 2026 12:092,89132,267,09122,678,0001,030,0002,117,632stderr
3Jul 8, 2026 12:092,90231,842,97622,657,0001,146,0002,117,632stderr
4Jul 8, 2026 12:092,90731,868,03122,686,0001,153,0002,117,632stderr
5Jul 8, 2026 12:092,91331,871,12722,737,0001,156,0002,117,632stderr
6Jul 8, 2026 12:0911,609103,169,53194,190,0001,011,0002,117,632stderr
7Jul 8, 2026 12:0911,741106,156,33095,163,0001,119,0002,117,632stderr
8Jul 8, 2026 12:0917,077148,063,427138,917,0001,118,0002,117,632stderr
9Jul 8, 2026 12:0917,126148,432,997139,432,0001,004,0002,117,632stderr