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 listApr 20, 2026 15:06BenBenScore: 48,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:1047,900406,821,707214,884,000177,904,0002,363,392
2Apr 20, 2026 15:1048,167420,571,313218,987,000175,989,0002,379,776
3Apr 20, 2026 15:1048,965415,507,605221,735,000179,785,0002,486,272