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 listMay 17, 2026 00:23M-RochatM-RochatScore: 12,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:2512,618112,245,27397,782,0005,690,0002,113,536
2May 17, 2026 00:2512,709112,997,55598,558,0005,656,0002,113,536
3May 17, 2026 00:2512,745113,298,31698,761,0005,751,0002,113,536
4May 17, 2026 00:2512,897114,557,27699,893,0005,867,0002,113,536
5May 17, 2026 00:2512,948116,257,940100,688,0005,487,0002,113,536
6May 17, 2026 00:2517,623153,317,027137,875,0006,635,0002,113,536
7May 17, 2026 00:2517,678156,997,605138,171,0006,791,0002,117,632
8May 17, 2026 00:2517,685153,790,053138,162,0006,855,0002,117,632
9May 17, 2026 00:2517,723154,161,892138,688,0006,648,0002,117,632