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,286Success
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:0848,077428,227,025224,563,000169,670,0002,260,992
2Apr 20, 2026 15:0848,286423,512,542209,973,000185,976,0002,256,896
3Apr 20, 2026 15:0848,747424,511,832211,856,000187,872,0002,260,992