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 listMar 4, 2026 01:32olliecrowolliecrowScore: 12,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 01:3212,239120,381,19699,354,0001,003,0002,424,832
2Mar 4, 2026 01:3212,250122,744,16798,441,0002,009,0002,420,736
3Mar 4, 2026 01:3212,271126,521,97999,619,0001,006,0002,461,696