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 listJun 17, 2026 14:56Maya RebholzMaya RebholzScore: 12,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 14:5712,200109,277,70299,038,0001,007,0002,113,536
2Jun 17, 2026 14:5712,213109,752,92099,140,0001,007,0002,113,536
3Jun 17, 2026 14:5712,242109,607,24899,385,0001,006,0002,113,536
4Jun 17, 2026 14:5712,419112,661,81099,771,0002,065,0002,113,536
5Jun 17, 2026 14:5712,722113,493,439103,318,0001,006,0002,113,536
6Jun 17, 2026 14:5712,737113,669,428103,442,0001,006,0002,113,536
7Jun 17, 2026 14:5712,768114,256,046103,695,0001,007,0002,113,536
8Jun 17, 2026 14:5712,802114,721,883103,974,0001,010,0002,113,536
9Jun 17, 2026 14:5712,827114,481,396104,181,0001,006,0002,113,536