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 listMay 4, 2026 23:56olliecrowolliecrowScore: 20,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:033,28942,913,22125,896,0001,075,0002,334,720
2May 5, 2026 00:033,30543,709,35226,040,0001,066,0002,527,232
3May 5, 2026 00:033,33745,718,87726,315,0001,053,0002,523,136
4May 5, 2026 00:033,34642,690,49126,382,0001,063,0002,449,408
5May 5, 2026 00:0320,752185,855,819167,897,0002,274,0002,322,432
6May 5, 2026 00:0320,937189,058,434169,340,0002,344,0002,498,560
7May 5, 2026 00:0321,171190,324,138171,313,0002,291,0002,514,944
8May 5, 2026 00:0321,190191,084,483171,658,0002,102,0002,490,368
9May 5, 2026 00:0321,474192,550,034173,952,0002,140,0002,351,104