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 9, 2025 19:20Valentin KofmanValentin KofmanScore: 7,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 19:207,26684,891,23746,455,00013,128,0002,363,392
2Jul 9, 2025 19:207,31282,727,66746,965,00012,990,0002,420,736
3Jul 9, 2025 19:208,07891,971,01352,191,00014,051,0002,306,048