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 23:37Valentin KofmanValentin KofmanScore: 16,675Success
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 23:3716,335157,178,671131,944,0001,999,0002,404,352
2Jul 6, 2025 23:3716,675161,342,003135,736,000998,0002,486,272
3Jul 6, 2025 23:3716,847162,486,617136,142,0002,002,0002,408,448