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:43Valentin KofmanValentin KofmanScore: 9,477Success
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:439,420102,937,76777,240,00002,510,848
2Jul 7, 2025 22:439,477103,714,22576,718,000996,0002,334,720
3Jul 7, 2025 22:439,525103,105,31776,103,0002,002,0002,322,432