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 24, 2026 00:21olliecrowolliecrowScore: 3,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 00:233,59346,690,69027,434,0002,032,0002,334,720
2Apr 24, 2026 00:233,62337,925,14728,686,0001,024,0002,383,872
3Apr 24, 2026 00:233,62537,787,26927,746,0001,981,0002,514,944
4Apr 24, 2026 00:233,63038,203,24727,782,0001,984,0002,510,848
5Apr 24, 2026 00:233,67847,453,72927,145,0003,016,0002,396,160
6Apr 24, 2026 00:233,69637,657,46528,290,0002,020,0002,539,520
7Apr 24, 2026 00:2336,940311,371,837296,917,0005,998,0002,510,848
8Apr 24, 2026 00:2337,100312,789,586302,215,0002,008,0002,535,424
9Apr 24, 2026 00:2337,178312,785,136299,868,0004,997,0002,367,488