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 27, 2026 21:47TudyMTudyMScore: 19,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:4919,267178,248,291156,995,000999,0002,383,872
2Apr 27, 2026 21:4919,301177,131,711157,272,0001,001,0002,375,680
3Apr 27, 2026 21:4919,336174,973,867156,562,0001,994,0002,310,144
4Apr 27, 2026 21:4919,356179,674,272156,724,0001,996,0002,383,872
5Apr 27, 2026 21:4919,362181,340,899156,772,0001,997,0002,379,776
6Apr 27, 2026 21:4919,375176,559,248157,877,000999,0002,379,776
7Apr 27, 2026 21:4919,378181,793,086155,906,0002,998,0002,306,048
8Apr 27, 2026 21:4919,393174,491,528157,025,0002,000,0002,379,776
9Apr 27, 2026 21:4919,454176,762,402156,534,0002,991,0002,314,240