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 listAug 23, 2026 16:07Victor MerckléVictor MerckléScore: 2,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:092,81731,416,09522,022,0001,078,0002,117,632stderr
2Aug 23, 2026 16:092,83131,393,84222,108,0001,110,0002,117,632stderr
3Aug 23, 2026 16:092,88532,010,39422,652,0001,013,0002,117,632stderr
4Aug 23, 2026 16:092,89032,077,85122,677,0001,026,0002,117,632stderr
5Aug 23, 2026 16:092,89932,774,65522,747,0001,026,0002,117,632stderr
6Aug 23, 2026 16:093,00133,596,18023,357,0001,252,0002,117,632stderr
7Aug 23, 2026 16:093,02333,139,87923,723,0001,066,0002,117,632stderr
8Aug 23, 2026 16:095,56053,789,87444,439,0001,156,0002,117,632stderr
9Aug 23, 2026 16:095,58254,821,10544,606,0001,171,0002,117,632stderr