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 listJan 8, 2026 08:32Rajarshi BasuRajarshi BasuScore: 793,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 08:36767,3636,327,737,6635,162,564,0001,129,810,0002,338,816
2Jan 8, 2026 08:32780,7856,434,156,5645,219,467,0001,182,972,0002,293,760
3Jan 8, 2026 08:36785,0426,473,074,2295,256,564,0001,180,778,0002,301,952
4Jan 8, 2026 08:36792,6286,527,773,9995,260,777,0001,238,770,0002,441,216
5Jan 8, 2026 08:36793,5916,540,465,3895,307,656,0001,199,792,0002,441,216
6Jan 8, 2026 08:32794,1786,549,067,2135,279,723,0001,232,534,0002,293,760
7Jan 8, 2026 08:32798,3816,579,189,2055,361,044,0001,185,682,0002,293,760
8Jan 8, 2026 08:36801,0386,601,464,7375,345,904,0001,222,606,0002,293,760
9Jan 8, 2026 08:36847,1006,981,845,1975,714,598,0001,231,620,0002,301,952