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 listApr 16, 2026 20:04olliecrowolliecrowScore: 21,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 20:0421,770206,991,460175,523,0002,991,0002,437,120
2Apr 16, 2026 20:0421,780203,122,736174,604,0003,990,0002,490,368
3Apr 16, 2026 20:0421,826211,932,147175,971,0002,999,0002,371,584