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 listAug 29, 2026 10:57Victor MerckléVictor MerckléScore: 2,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:592,82331,587,41322,083,0001,070,0002,117,632stderr
2Aug 29, 2026 10:592,82533,106,08022,030,0001,142,0002,117,632stderr
3Aug 29, 2026 10:592,83231,603,54122,140,0001,086,0002,117,632stderr
4Aug 29, 2026 10:592,83532,304,68822,077,0001,171,0002,117,632stderr
5Aug 29, 2026 10:592,83931,656,20322,157,0001,128,0002,117,632stderr
6Aug 29, 2026 10:592,83931,780,35122,122,0001,158,0002,117,632stderr
7Aug 29, 2026 10:595,54053,793,59244,413,0001,015,0002,117,632stderr
8Aug 29, 2026 10:595,60255,072,15044,925,0001,019,0002,117,632stderr
9Aug 29, 2026 10:5914,546127,705,126118,272,0001,006,0002,117,632stderr