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 10, 2026 08:48Pavel SkripkinPavel SkripkinScore: 4,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:494,28448,657,85630,958,0004,178,0002,297,856
2May 10, 2026 08:494,29149,858,14931,123,0004,064,0002,367,488
3May 10, 2026 08:494,31757,273,94231,168,0004,238,0002,449,408
4May 10, 2026 08:494,33952,883,97031,361,0004,224,0002,433,024
5May 10, 2026 08:494,50351,772,31732,264,0004,663,0002,441,216
6May 10, 2026 08:4925,100223,216,176202,806,0003,021,0002,514,944
7May 10, 2026 08:4925,107220,413,906202,862,0003,023,0002,433,024
8May 10, 2026 08:4925,549226,169,790204,922,0004,585,0002,535,424
9May 10, 2026 08:4925,862227,301,978207,920,0004,154,0002,490,368