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 27, 2026 02:16Dominique GarmierDominique GarmierScore: 12,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 02:1612,526125,276,229100,722,0001,994,0002,371,584
2Mar 27, 2026 02:1612,534124,565,36198,789,0003,991,0002,404,352
3Mar 27, 2026 02:1612,668125,977,265100,882,0002,996,0002,449,408