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 28, 2025 11:50KeefeKeefeScore: 16,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2025 11:5016,864162,234,105137,282,0001,002,0002,260,992
2Apr 28, 2025 11:5016,868160,302,797138,320,00002,355,200
3Apr 28, 2025 11:5016,889168,409,242138,487,00002,367,488
4Apr 28, 2025 11:5016,899168,092,001137,572,000996,0002,367,488
5Apr 28, 2025 11:5016,906166,858,364137,631,000997,0002,359,296
6Apr 28, 2025 11:5016,908167,014,303136,655,0001,994,0002,363,392
7Apr 28, 2025 11:5016,910163,590,214137,662,000997,0002,359,296
8Apr 28, 2025 11:5016,910166,668,677137,662,000997,0002,260,992
9Apr 28, 2025 11:5016,920171,018,726136,751,0001,996,0002,260,992