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 2, 2026 00:51Victor MerckléVictor MerckléScore: 3,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 00:523,12433,391,82124,545,0001,075,0002,117,632stderr
2Jul 2, 2026 00:523,16833,858,01324,899,0001,082,0002,117,632stderr
3Jul 2, 2026 00:523,18833,981,78124,982,0001,164,0002,117,632stderr
4Jul 2, 2026 00:523,18934,011,74524,981,0001,176,0002,117,632stderr
5Jul 2, 2026 00:523,19534,029,58525,067,0001,137,0002,117,632stderr
6Jul 2, 2026 00:523,20834,218,78525,184,0001,129,0002,117,632stderr
7Jul 2, 2026 00:523,33435,236,95026,044,0001,302,0002,117,632stderr
8Jul 2, 2026 00:5212,087107,352,39098,107,0001,009,0002,117,632stderr
9Jul 2, 2026 00:5212,230108,200,61499,278,0001,010,0002,117,632stderr