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 14:32Victor MerckléVictor MerckléScore: 11,877Success
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 14:332,95832,173,71423,079,0001,179,0002,113,536
2Jul 2, 2026 14:333,00332,892,87723,616,0001,016,0002,113,536
3Jul 2, 2026 14:333,01232,946,23323,670,0001,029,0002,113,536
4Jul 2, 2026 14:333,03932,855,18823,906,0001,021,0002,113,536
5Jul 2, 2026 14:3311,877105,339,19196,221,0001,174,0002,113,536
6Jul 2, 2026 14:3311,893105,430,28896,255,0001,272,0002,113,536
7Jul 2, 2026 14:3312,083107,050,81797,961,0001,122,0002,113,536
8Jul 2, 2026 14:3312,471109,926,130101,142,0001,124,0002,113,536
9Jul 2, 2026 14:3312,480110,269,641101,208,0001,128,0002,113,536