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 listApr 14, 2026 04:28Yuriy LyfenkoYuriy LyfenkoScore: 3,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 04:273,15356,432,97119,887,0005,966,0002,301,952
2Apr 14, 2026 04:273,15353,330,83023,868,0001,989,0002,514,944
3Apr 14, 2026 04:273,16054,586,32921,925,0003,986,0002,514,944
4Apr 14, 2026 04:273,16952,809,97123,984,0001,998,0002,510,848
5Apr 14, 2026 04:273,17550,091,51324,035,0002,002,0002,514,944
6Apr 14, 2026 04:273,19653,475,46622,176,0004,032,0002,351,104
7Apr 14, 2026 04:283,21754,419,92823,339,0003,044,0002,371,584
8Apr 14, 2026 04:273,25056,425,45925,624,0001,024,0002,445,312
9Apr 14, 2026 04:273,25154,131,26126,655,00002,281,472
10Apr 14, 2026 04:283,27261,010,92124,846,0001,987,0002,523,136
11Apr 14, 2026 04:273,27355,071,63524,852,0001,988,0002,510,848
12Apr 14, 2026 04:283,30553,616,82323,085,0004,014,0002,510,848