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 08:51Valentin KofmanValentin KofmanScore: 7,335Success
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 08:517,21081,239,42540,080,00019,038,0002,457,600
2Jul 9, 2025 08:517,33586,385,16547,116,00013,032,0002,498,560
3Jul 9, 2025 08:517,65591,628,97143,838,00018,930,0002,461,696