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 listJun 11, 2026 05:31Victor MerckléVictor MerckléScore: 3,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 05:333,48638,599,99826,400,0002,190,0002,138,112
2Jun 11, 2026 05:333,50439,399,57126,572,0002,161,0002,138,112
3Jun 11, 2026 05:333,51836,467,78826,737,0002,118,0002,138,112
4Jun 11, 2026 05:333,52138,930,21026,660,0002,219,0002,138,112
5Jun 11, 2026 05:333,52638,915,10626,634,0002,282,0002,138,112
6Jun 11, 2026 05:333,54439,735,64726,791,0002,276,0002,138,112
7Jun 11, 2026 05:333,54538,817,26926,982,0002,092,0002,138,112
8Jun 11, 2026 05:333,55839,385,16327,086,0002,091,0002,138,112
9Jun 11, 2026 05:333,58937,969,01227,139,0002,297,0002,138,112