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 21, 2026 04:55Yuriy LyfenkoYuriy LyfenkoScore: 4,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:554,088555,958,77731,492,0002,031,0002,404,352
2Mar 21, 2026 04:554,125565,413,99929,849,0003,979,0002,473,984
3Mar 21, 2026 04:554,130561,655,94931,876,0001,992,0002,310,144
4Mar 21, 2026 04:554,175557,702,46731,215,0003,020,0002,371,584
5Mar 21, 2026 04:554,196560,683,68032,387,0002,024,0002,441,216
6Mar 21, 2026 04:554,259561,868,49232,932,0001,995,0002,334,720