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 15, 2026 21:14zielajzielajScore: 5,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 21:132,80043,596,98021,966,000998,0002,334,720
2Apr 15, 2026 21:145,32471,842,04142,644,0001,015,0002,371,584
3Apr 15, 2026 21:135,36665,307,75442,003,0002,000,0002,322,432
4Apr 15, 2026 21:145,36671,672,94642,005,0002,000,0002,408,448
5Apr 15, 2026 21:135,36769,741,03043,013,0001,000,0002,338,816
6Apr 15, 2026 21:145,37465,324,49238,057,0006,009,0002,347,008