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 listSep 19, 2026 19:48Andrew EpsteinAndrew EpsteinScore: 127,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:49126,2371,045,641,7391,033,093,0002,055,0002,117,632stderr
2Sep 19, 2026 19:49126,6351,048,871,3151,036,344,0002,065,0002,117,632stderr
3Sep 19, 2026 19:49126,9221,051,912,0991,038,754,0002,012,0002,117,632stderr
4Sep 19, 2026 19:49127,1751,053,425,9981,040,740,0002,099,0002,117,632stderr
5Sep 19, 2026 19:49127,2301,054,057,1701,041,105,0002,185,0002,117,632stderr
6Sep 19, 2026 19:49127,4931,056,013,5631,043,369,0002,077,0002,117,632stderr
7Sep 19, 2026 19:49127,6151,056,976,0671,044,422,0002,023,0002,117,632stderr
8Sep 19, 2026 19:49128,0011,060,738,0431,047,590,0002,026,0002,117,632stderr
9Sep 19, 2026 19:49128,1151,061,053,4781,048,520,0002,030,0002,117,632stderr