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 9, 2025 20:01Valentin KofmanValentin KofmanScore: 7,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 20:016,83182,929,20145,010,00011,002,0002,453,504
2Jul 9, 2025 20:017,09280,506,30934,090,00024,063,0002,326,528
3Jul 9, 2025 20:017,14489,053,26641,409,00017,169,0002,342,912