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 listSep 29, 2026 08:14C21C21Score: 4,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 08:154,18744,849,05832,036,0002,304,0002,113,536
2Sep 29, 2026 08:154,20744,990,68432,193,0002,308,0002,113,536
3Sep 29, 2026 08:154,22247,665,92432,502,0002,125,0002,113,536
4Sep 29, 2026 08:154,23245,331,39832,573,0002,134,0002,113,536
5Sep 29, 2026 08:154,24145,242,61932,670,0002,114,0002,113,536
6Sep 29, 2026 08:154,25445,354,00432,767,0002,120,0002,113,536
7Sep 29, 2026 08:154,25945,516,28632,853,0002,071,0002,113,536
8Sep 29, 2026 08:154,27545,598,29232,843,0002,219,0002,113,536
9Sep 29, 2026 08:154,29645,757,90333,108,0002,121,0002,113,536