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 listMar 28, 2026 15:47Dominique GarmierDominique GarmierScore: 10,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 15:477,33687,410,69959,155,0001,002,0002,473,984
2Mar 28, 2026 15:4710,261112,356,71881,133,0003,004,0002,387,968
3Mar 28, 2026 15:4710,281107,429,74384,301,00002,433,024
4Mar 28, 2026 15:4710,307114,197,31683,510,0001,006,0002,502,656
5Mar 28, 2026 15:4710,309110,963,15283,527,0001,006,0002,314,240
6Mar 28, 2026 15:4710,318115,264,86884,607,00002,465,792
7Mar 28, 2026 15:4710,343107,464,97682,820,0001,995,0002,478,080
8Mar 28, 2026 15:4710,380108,020,94184,112,0001,001,0002,367,488
9Mar 28, 2026 15:4710,412106,914,11884,371,0001,004,0002,449,408