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 29, 2026 02:58olliecrowolliecrowScore: 20,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 02:5914,455140,216,176117,534,0001,004,0002,342,912
2Apr 29, 2026 02:5914,469137,044,707117,643,0001,005,0002,551,808
3Apr 29, 2026 02:5914,484137,174,417115,781,0002,994,0002,498,560
4Apr 29, 2026 02:5914,488133,452,818116,807,0001,996,0002,437,120
5Apr 29, 2026 02:5920,310184,657,693162,553,0003,989,0002,351,104
6Apr 29, 2026 02:5920,363182,008,562162,984,0003,999,0002,510,848
7Apr 29, 2026 02:5920,369188,314,142163,029,0004,000,0002,551,808
8Apr 29, 2026 02:5920,379183,200,909163,112,0004,002,0002,523,136
9Apr 29, 2026 02:5920,404183,346,973166,312,0001,001,0002,555,904