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 16:40Victor MerckléVictor MerckléScore: 5,422Success
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 16:452,75230,859,89021,478,0001,092,0002,117,632stderr
2Aug 19, 2026 16:452,76231,490,50221,480,0001,175,0002,117,632stderr
3Aug 19, 2026 16:452,76930,980,57921,698,0001,012,0002,117,632stderr
4Aug 19, 2026 16:452,78331,858,80121,805,0001,023,0002,117,632stderr
5Aug 19, 2026 16:455,42253,474,55543,330,0001,135,0002,117,632stderr
6Aug 19, 2026 16:455,42553,476,23643,372,0001,116,0002,117,632stderr
7Aug 19, 2026 16:455,44254,286,58543,520,0001,112,0002,117,632stderr
8Aug 19, 2026 16:457,98973,823,14264,456,0001,061,0002,117,632stderr
9Aug 19, 2026 16:458,01574,027,61664,627,0001,103,0002,117,632stderr