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 10, 2025 23:34Valentin KofmanValentin KofmanScore: 6,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2025 23:346,94080,467,65435,940,00020,965,0002,457,600
2Jul 10, 2025 23:346,99682,684,26141,264,00016,103,0002,428,928
3Jul 10, 2025 23:347,06484,062,89144,944,00012,983,0002,514,944