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 3, 2026 11:06Victor MerckléVictor MerckléScore: 11,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:082,96932,283,43223,255,0001,091,0002,113,536
2Jul 3, 2026 11:083,00232,516,28723,515,0001,109,0002,113,536
3Jul 3, 2026 11:083,00632,570,51423,532,0001,118,0002,113,536
4Jul 3, 2026 11:083,04332,868,44823,944,0001,014,0002,113,536
5Jul 3, 2026 11:0811,955105,925,09896,861,0001,174,0002,113,536
6Jul 3, 2026 11:0811,961105,972,68097,043,0001,043,0002,113,536
7Jul 3, 2026 11:0811,975106,079,66697,070,0001,126,0002,113,536
8Jul 3, 2026 11:0811,999106,662,75597,161,0001,235,0002,113,536
9Jul 3, 2026 11:0812,521110,575,051101,516,0001,164,0002,113,536