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 09:08Valentin KofmanValentin KofmanScore: 38,517Success
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 09:0838,489344,936,796314,614,000998,0002,318,336
2Jul 6, 2025 09:0838,517344,732,019313,841,0001,998,0002,392,064
3Jul 6, 2025 09:0839,084345,350,964320,488,00002,273,280