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 listJan 6, 2026 10:48Rajarshi BasuRajarshi BasuScore: 71,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 10:494,73462,611,05332,849,0005,972,0002,527,232
2Jan 6, 2026 10:494,76765,336,58535,080,0004,009,0002,281,472
3Jan 6, 2026 10:494,99967,343,15335,991,0004,998,0002,486,272
4Jan 6, 2026 10:495,06369,104,57638,481,0003,037,0002,408,448
5Jan 6, 2026 10:495,11068,142,43437,911,0003,990,0002,428,928
6Jan 6, 2026 10:485,22169,876,09239,828,0002,987,0002,510,848
7Jan 6, 2026 10:4971,736616,864,851473,189,000115,046,0002,514,944
8Jan 6, 2026 10:4972,351624,136,050471,427,000121,852,0002,359,296
9Jan 6, 2026 10:4976,953659,954,162509,009,000122,002,0002,379,776
10Jan 6, 2026 10:4985,345729,202,593566,863,000132,967,0002,400,256
11Jan 6, 2026 10:4887,631750,128,711598,647,000119,929,0002,359,296
12Jan 6, 2026 10:4891,826779,191,362645,123,000107,853,0002,527,232