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 22:09Valentin KofmanValentin KofmanScore: 7,294Success
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 22:097,07085,048,01842,983,00014,994,0002,469,888
2Jul 10, 2025 22:097,29482,720,54037,880,00021,930,0002,318,336
3Jul 10, 2025 22:097,30981,920,64537,960,00021,977,0002,277,376