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 listSep 3, 2026 03:59Josu San MartinJosu San MartinScore: 4,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:004,45146,574,59834,268,0002,233,0002,113,536
2Sep 3, 2026 04:004,46746,671,26934,435,0002,201,0002,113,536
3Sep 3, 2026 04:004,52947,161,62434,951,0002,194,0002,113,536
4Sep 3, 2026 04:004,54847,296,87135,076,0002,224,0002,113,536
5Sep 3, 2026 04:004,56248,186,32235,169,0002,246,0002,113,536
6Sep 3, 2026 04:004,56448,088,54035,024,0002,402,0002,113,536
7Sep 3, 2026 04:004,58548,402,92034,549,0003,052,0002,113,536
8Sep 3, 2026 04:0020,106175,703,201157,739,0007,136,0002,117,632
9Sep 3, 2026 04:0023,091199,447,371182,976,0006,378,0002,117,632