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 listJul 7, 2025 22:42Valentin KofmanValentin KofmanScore: 9,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 22:429,337103,029,81775,560,0001,007,0002,334,720
2Jul 7, 2025 22:429,360106,796,63675,753,000996,0002,334,720
3Jul 7, 2025 22:429,361107,105,46776,760,00002,334,720