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 listNov 5, 2026 01:31e1011e1011Score: 43,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 01:3416,525146,377,046131,430,0004,076,0002,113,536
2Nov 5, 2026 01:3417,443154,422,716139,012,0004,024,0002,113,536
3Nov 5, 2026 01:3418,347161,445,926145,368,0005,079,0002,113,536
4Nov 5, 2026 01:3441,197349,268,672335,793,0002,027,0002,113,536
5Nov 5, 2026 01:3443,957371,922,756356,367,0004,083,0002,113,536
6Nov 5, 2026 01:3444,263373,810,636359,855,0003,102,0002,113,536
7Nov 5, 2026 01:3444,541377,260,037361,237,0004,007,0002,113,536
8Nov 5, 2026 01:3444,552376,786,449361,111,0004,219,0002,113,536
9Nov 5, 2026 01:3445,414383,843,637368,232,0004,164,0002,113,536