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 2, 2026 15:07A_ShamanA_ShamanScore: 13,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 15:0813,084116,582,871106,278,0001,012,0002,113,536
2Jul 2, 2026 15:0813,121116,838,064105,559,0002,040,0002,113,536
3Jul 2, 2026 15:0813,167117,411,897106,967,0001,009,0002,113,536
4Jul 2, 2026 15:0813,188117,446,912107,127,0001,016,0002,113,536
5Jul 2, 2026 15:0813,822122,745,711112,335,0001,008,0002,113,536
6Jul 2, 2026 15:0813,850122,953,603112,556,0001,016,0002,113,536
7Jul 2, 2026 15:0813,858123,086,984112,626,0001,016,0002,113,536
8Jul 2, 2026 15:0813,868123,028,819112,708,0001,016,0002,113,536
9Jul 2, 2026 15:0813,944123,685,038113,331,0001,010,0002,113,536