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 15:32Andrew EpsteinAndrew EpsteinScore: 23,188Success
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 15:3323,112200,264,820187,512,0002,011,0002,117,632stderr
2Sep 19, 2026 15:3323,114199,961,483187,526,0002,010,0002,117,632stderr
3Sep 19, 2026 15:3323,126202,661,111186,599,0003,041,0002,117,632stderr
4Sep 19, 2026 15:3323,159200,321,380187,898,0002,011,0002,117,632stderr
5Sep 19, 2026 15:3323,188200,694,483187,118,0003,026,0002,117,632stderr
6Sep 19, 2026 15:3323,270201,312,743187,771,0003,043,0002,117,632stderr
7Sep 19, 2026 15:3323,286201,377,827187,939,0003,007,0002,117,632stderr
8Sep 19, 2026 15:3323,307201,622,213188,110,0003,012,0002,117,632stderr
9Sep 19, 2026 15:3323,389202,208,885188,787,0003,006,0002,117,632stderr