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 16, 2026 15:54Maya RebholzMaya RebholzScore: 31,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:5530,032256,152,804218,730,00027,536,0002,199,552
2Jun 16, 2026 15:5530,917263,019,147227,021,00026,499,0002,199,552
3Jun 16, 2026 15:5531,191265,001,007229,548,00026,223,0002,199,552
4Jun 16, 2026 15:5531,493267,496,981229,690,00028,556,0002,199,552
5Jun 16, 2026 15:5531,582268,228,675230,624,00028,353,0002,199,552
6Jun 16, 2026 15:5531,667268,888,283233,241,00026,436,0002,199,552
7Jun 16, 2026 15:5531,999271,703,998233,532,00028,865,0002,199,552
8Jun 16, 2026 15:5532,502276,139,028239,813,00026,706,0002,199,552
9Jun 16, 2026 15:5533,633285,076,239247,036,00028,759,0002,199,552