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 listMay 25, 2026 14:52Elijah KinElijah KinScore: 82,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 14:5281,733682,135,470518,926,000151,287,0002,113,536
2May 25, 2026 14:5281,805683,322,488518,642,000152,159,0002,113,536
3May 25, 2026 14:5282,306684,645,988518,494,000156,418,0002,113,536
4May 25, 2026 14:5282,427686,070,609525,915,000149,987,0002,113,536
5May 25, 2026 14:5282,505687,694,180519,007,000157,536,0002,113,536
6May 25, 2026 14:5282,529688,592,578519,321,000157,420,0002,113,536
7May 25, 2026 14:5282,914690,343,787528,185,000151,715,0002,113,536
8May 25, 2026 14:5283,248695,289,952532,477,000150,160,0002,113,536
9May 25, 2026 14:5283,253693,372,726533,320,000149,362,0002,113,536