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 04:09olliecrowolliecrowScore: 12,220Success
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 04:0912,218127,994,89698,185,0002,003,0002,420,736
2Mar 4, 2026 04:0912,220121,797,64397,196,0003,006,0002,412,544
3Mar 4, 2026 04:0912,242124,123,11899,383,0001,003,0002,461,696