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 13:14Josu San MartinJosu San MartinScore: 3,453Success
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 13:163,35638,319,26726,443,0001,077,0002,113,536
2Sep 3, 2026 13:163,35937,636,99326,504,0001,043,0002,113,536
3Sep 3, 2026 13:163,37637,727,88026,631,0001,053,0002,113,536
4Sep 3, 2026 13:163,38138,112,48726,633,0001,092,0002,113,536
5Sep 3, 2026 13:163,45340,637,76527,235,0001,081,0002,113,536
6Sep 3, 2026 13:1613,743123,611,329111,620,0001,078,0002,113,536
7Sep 3, 2026 13:1614,368127,929,157116,779,0001,043,0002,113,536
8Sep 3, 2026 13:1614,397128,710,859116,991,0001,072,0002,113,536
9Sep 3, 2026 13:1614,514129,791,711117,942,0001,079,0002,113,536