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:53BenBenScore: 43,381Success
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:5642,957379,362,826183,609,000168,641,0002,478,080
2Apr 20, 2026 15:5643,381380,857,333181,860,000173,866,0002,330,624
3Apr 20, 2026 15:5643,408376,512,203179,975,000175,976,0002,478,080