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 07:32Rajarshi BasuRajarshi BasuScore: 78,605Success
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 07:3768,581590,287,881442,499,000119,864,0002,322,432
2Jan 8, 2026 07:3768,921592,714,317451,323,000113,829,0002,281,472
3Jan 8, 2026 07:3270,567607,117,190455,725,000122,926,0002,281,472
4Jan 8, 2026 07:3278,605670,869,227542,631,000101,930,0002,293,760
5Jan 8, 2026 07:3282,113699,971,691560,437,000112,886,0002,322,432
6Jan 8, 2026 07:3784,658720,677,923581,324,000112,868,0002,326,528