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 listJul 10, 2026 19:06Genos0Genos0Score: 108,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 19:0782,409686,070,296525,007,000150,754,0002,113,536
2Jul 10, 2026 19:0791,360758,984,621593,890,000155,267,0002,113,536
3Jul 10, 2026 19:0793,281774,693,345614,833,000150,076,0002,113,536
4Jul 10, 2026 19:07102,826853,410,382693,343,000149,833,0002,113,536
5Jul 10, 2026 19:07108,587900,317,762738,232,000152,189,0002,113,536
6Jul 10, 2026 19:07112,220930,671,998766,754,000153,456,0002,113,536
7Jul 10, 2026 19:07116,279963,819,916800,173,000153,316,0002,113,536
8Jul 10, 2026 19:07116,790968,004,840805,999,000151,682,0002,113,536
9Jul 10, 2026 19:07133,9961,109,153,860946,783,000151,991,0002,113,536