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 22, 2026 02:08olliecrowolliecrowScore: 14,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:0914,461136,778,813117,580,0001,004,0002,408,448
2Apr 22, 2026 02:0914,473134,825,691114,695,0003,989,0002,396,160
3Apr 22, 2026 02:0914,494137,327,971115,858,0002,996,0002,347,008
4Apr 22, 2026 02:0914,505140,074,148116,947,0001,999,0002,584,576
5Apr 22, 2026 02:0914,509134,497,159115,976,0002,999,0002,342,912
6Apr 22, 2026 02:0940,080341,912,351326,664,0001,997,0002,408,448
7Apr 22, 2026 02:0940,107343,544,341324,884,0003,998,0002,326,528
8Apr 22, 2026 02:0940,124348,606,954325,021,0004,000,0002,371,584
9Apr 22, 2026 02:0940,220349,131,361324,810,0004,997,0002,572,288