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 3, 2026 03:43Josu San MartinJosu San MartinScore: 4,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 03:444,38045,992,48633,731,0002,189,0002,113,536
2Sep 3, 2026 03:444,43746,454,55334,175,0002,216,0002,113,536
3Sep 3, 2026 03:444,45146,463,52034,313,0002,186,0002,113,536
4Sep 3, 2026 03:444,47346,669,17334,349,0002,336,0002,113,536
5Sep 3, 2026 03:444,49247,230,99034,784,0002,056,0002,113,536
6Sep 3, 2026 03:444,50948,082,03134,783,0002,191,0002,113,536
7Sep 3, 2026 03:444,54247,183,11035,076,0002,170,0002,113,536
8Sep 3, 2026 03:444,58047,672,74735,162,0002,399,0002,113,536
9Sep 3, 2026 03:4415,459137,558,399124,583,0002,184,0002,117,632