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 20, 2026 03:06olliecrowolliecrowScore: 3,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:063,49858,007,93427,657,0001,024,0002,428,928
2Mar 20, 2026 03:063,53662,455,46125,994,0002,999,0002,465,792
3Mar 20, 2026 03:0618,531181,397,053147,954,0003,998,0002,265,088