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 11:59olliecrowolliecrowScore: 23,741Success
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 12:003,28945,504,25923,979,0002,997,0002,306,048
2Apr 24, 2026 12:003,30343,717,94125,082,0002,006,0002,297,856
3Apr 24, 2026 12:003,32544,377,85526,259,0001,009,0002,519,040
4Apr 24, 2026 12:0023,685212,834,792193,220,0001,001,0002,371,584
5Apr 24, 2026 12:0023,741212,361,680189,693,0004,991,0002,310,144
6Apr 24, 2026 12:0023,765211,339,410190,877,0003,997,0002,314,240
7Apr 24, 2026 12:0023,772210,491,025189,934,0004,998,0002,433,024
8Apr 24, 2026 12:0023,784212,604,588192,035,0003,000,0002,465,792
9Apr 24, 2026 12:0023,829210,003,417192,398,0003,006,0002,498,560