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 19, 2026 14:44Victor MerckléVictor MerckléScore: 2,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 14:452,79031,876,30321,755,0001,124,0002,117,632stderr
2Aug 19, 2026 14:452,80232,049,82721,835,0001,144,0002,117,632stderr
3Aug 19, 2026 14:452,80431,985,99421,849,0001,144,0002,117,632stderr
4Aug 19, 2026 14:452,80631,413,06021,867,0001,149,0002,117,632stderr
5Aug 19, 2026 14:452,81732,164,10721,957,0001,147,0002,117,632stderr
6Aug 19, 2026 14:452,82031,561,89521,942,0001,187,0002,117,632stderr
7Aug 19, 2026 14:455,51554,079,86044,204,0001,020,0002,117,632stderr
8Aug 19, 2026 14:455,52453,698,86744,275,0001,022,0002,117,632stderr
9Aug 19, 2026 14:455,53453,578,63544,365,0001,021,0002,117,632stderr