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 23, 2026 17:47Victor MerckléVictor MerckléScore: 2,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:492,82431,498,26722,064,0001,095,0002,117,632stderr
2Aug 23, 2026 17:492,82531,519,63622,080,0001,093,0002,117,632stderr
3Aug 23, 2026 17:492,85332,343,17722,192,0001,203,0002,117,632stderr
4Aug 23, 2026 17:492,85531,763,77022,343,0001,068,0002,117,632stderr
5Aug 23, 2026 17:492,86032,445,62522,251,0001,205,0002,117,632stderr
6Aug 23, 2026 17:495,49953,595,21644,079,0001,018,0002,117,632stderr
7Aug 23, 2026 17:495,54453,746,44444,441,0001,022,0002,117,632stderr
8Aug 23, 2026 17:495,56954,086,35044,651,0001,021,0002,117,632stderr
9Aug 23, 2026 17:495,58754,834,52844,793,0001,021,0002,117,632stderr