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 17:30Andrew EpsteinAndrew EpsteinScore: 23,028Success
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 17:3022,927198,408,081184,933,0003,072,0002,117,632stderr
2Sep 19, 2026 17:3022,972198,878,616185,366,0003,007,0002,117,632stderr
3Sep 19, 2026 17:3022,988199,563,422186,495,0002,011,0002,117,632stderr
4Sep 19, 2026 17:3023,009199,008,684186,663,0002,012,0002,117,632stderr
5Sep 19, 2026 17:3023,028199,184,938186,821,0002,010,0002,117,632stderr
6Sep 19, 2026 17:3023,146200,115,758186,774,0003,024,0002,117,632stderr
7Sep 19, 2026 17:3023,253201,144,844187,597,0003,083,0002,117,632stderr
8Sep 19, 2026 17:3023,359202,100,023188,213,0003,336,0002,117,632stderr
9Sep 19, 2026 17:3023,439205,188,146189,014,0003,193,0002,117,632stderr