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 6, 2025 11:27Valentin KofmanValentin KofmanScore: 24,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 11:2724,406227,627,226199,131,0001,000,0002,392,064
2Jul 6, 2025 11:2724,497225,345,794198,880,0001,998,0002,273,280
3Jul 6, 2025 11:2724,523223,563,127200,089,0001,000,0002,400,256