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 20:55Josu San MartinJosu San MartinScore: 6,167Success
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 20:556,14960,336,03949,405,0001,019,0002,117,632
2Sep 3, 2026 20:556,15460,658,66749,450,0001,017,0002,117,632
3Sep 3, 2026 20:556,15760,370,06749,366,0001,128,0002,117,632
4Sep 3, 2026 20:556,16060,501,16249,502,0001,015,0002,117,632
5Sep 3, 2026 20:556,16761,372,77749,537,0001,033,0002,117,632
6Sep 3, 2026 20:556,19862,175,10649,796,0001,032,0002,117,632
7Sep 3, 2026 20:556,21061,092,48649,900,0001,022,0002,117,632
8Sep 3, 2026 20:556,22161,050,94149,994,0001,025,0002,117,632
9Sep 3, 2026 20:5518,373161,522,165149,650,0001,012,0002,117,632