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 listMay 5, 2026 02:03olliecrowolliecrowScore: 39,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 02:0514,429132,614,103116,085,0002,233,0002,449,408
2May 5, 2026 02:0514,467134,039,033116,400,0002,234,0002,596,864
3May 5, 2026 02:0514,495134,054,369116,624,0002,240,0002,584,576
4May 5, 2026 02:0539,799342,123,111321,894,0004,458,0002,408,448
5May 5, 2026 02:0539,802342,438,186321,993,0004,387,0002,334,720
6May 5, 2026 02:0539,815341,795,025323,209,0003,280,0002,572,288
7May 5, 2026 02:0539,827338,771,302323,249,0003,340,0002,551,808
8May 5, 2026 02:0539,827339,104,154322,271,0004,312,0002,375,680
9May 5, 2026 02:0539,835339,020,240323,583,0003,070,0002,580,480