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 26, 2026 18:26TudyMTudyMScore: 32,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:2731,756279,685,454259,401,0001,001,0002,371,584
2Apr 26, 2026 18:2731,899286,088,197259,578,0001,996,0002,355,200
3Apr 26, 2026 18:2732,032279,786,616259,671,0002,996,0002,371,584
4Apr 26, 2026 18:2732,092284,126,966262,161,0001,000,0002,371,584
5Apr 26, 2026 18:2732,105284,631,905262,268,0001,001,0002,363,392
6Apr 26, 2026 18:2732,344284,639,936264,222,0001,000,0002,457,600
7Apr 26, 2026 18:2732,532281,202,208264,769,0001,998,0002,359,296
8Apr 26, 2026 18:2732,555286,376,391264,956,0001,999,0002,355,200
9Apr 26, 2026 18:2732,731284,063,190266,399,0002,003,0002,363,392