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 02:22olliecrowolliecrowScore: 23,760Success
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 02:233,30143,973,27324,068,0003,008,0002,469,888
2Apr 24, 2026 02:233,30448,938,77426,094,0001,003,0002,330,624
3Apr 24, 2026 02:233,32743,042,66126,279,0001,010,0002,420,736
4Apr 24, 2026 02:2323,753215,654,976191,785,0002,996,0002,527,232
5Apr 24, 2026 02:2323,760212,634,759190,837,0003,996,0002,543,616
6Apr 24, 2026 02:2323,782210,347,591188,020,0007,000,0002,347,008
7Apr 24, 2026 02:2323,786211,572,716192,047,0003,000,0002,498,560
8Apr 24, 2026 02:2323,788218,418,528192,066,0003,001,0002,523,136
9Apr 24, 2026 02:2323,884213,198,180192,856,0002,997,0002,523,136