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 23:31Valentin KofmanValentin KofmanScore: 7,362Success
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 23:317,03085,079,05842,478,00015,170,0002,412,544
2Jul 10, 2025 23:317,36281,414,71940,244,00020,122,0002,498,560
3Jul 10, 2025 23:317,36786,469,01049,335,00011,075,0002,375,680