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 29, 2026 13:40TudyMTudyMScore: 104,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:45104,470876,357,188853,666,0002,995,0002,297,856
2Apr 29, 2026 13:45104,543874,699,454855,258,0001,995,0002,375,680
3Apr 29, 2026 13:45104,764877,395,275856,074,0002,993,0002,363,392
4Apr 29, 2026 13:45104,770877,453,320856,128,0002,993,0002,363,392
5Apr 29, 2026 13:45104,881881,894,918858,035,0001,995,0002,371,584
6Apr 29, 2026 13:45105,000886,263,501858,010,0002,996,0002,293,760
7Apr 29, 2026 13:45105,499882,662,156863,100,0001,997,0002,371,584
8Apr 29, 2026 13:45105,543883,773,753864,457,000998,0002,359,296
9Apr 29, 2026 13:45105,736885,215,016864,044,0002,993,0002,367,488