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 12:39Josu San MartinJosu San MartinScore: 14,456Success
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 12:483,47938,555,57127,485,0001,046,0002,113,536
2Sep 3, 2026 12:483,49339,441,17927,554,0001,091,0002,113,536
3Sep 3, 2026 12:483,54639,138,49828,045,0001,039,0002,113,536
4Sep 3, 2026 12:4814,444128,783,866117,378,0001,066,0002,113,536
5Sep 3, 2026 12:4814,456128,571,913117,508,0001,039,0002,113,536
6Sep 3, 2026 12:4814,495129,002,721117,831,0001,036,0002,113,536
7Sep 3, 2026 12:4814,512129,050,865117,927,0001,077,0002,113,536
8Sep 3, 2026 12:4814,530129,383,134118,080,0001,074,0002,113,536
9Sep 3, 2026 12:4814,605129,798,900118,736,0001,030,0002,113,536