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 listMay 15, 2026 00:48zielajzielajScore: 2,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:492,67429,432,06420,785,0001,146,0002,117,632stderr
2May 15, 2026 00:492,68531,147,81320,898,0001,122,0002,117,632stderr
3May 15, 2026 00:492,68529,302,58820,877,0001,140,0002,117,632stderr
4May 15, 2026 00:492,69030,175,79420,879,0001,180,0002,117,632stderr
5May 15, 2026 00:492,70030,193,73921,099,0001,048,0002,117,632stderr
6May 15, 2026 00:495,13853,351,66441,109,0001,026,0002,117,632stderr
7May 15, 2026 00:495,14450,331,51241,169,0001,015,0002,117,632stderr
8May 15, 2026 00:495,16649,752,08941,336,0001,032,0002,117,632stderr
9May 15, 2026 00:495,17149,640,93841,381,0001,028,0002,117,632stderr