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 listMar 20, 2026 05:04olliecrowolliecrowScore: 21,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 13:533,25251,771,27025,642,0001,025,0002,531,328
2Mar 20, 2026 13:533,25247,261,21125,644,0001,025,0002,387,968
3Mar 20, 2026 13:533,25756,796,39225,678,0001,027,0002,387,968
4Mar 20, 2026 13:533,27449,958,83524,857,0001,988,0002,531,328
5Mar 20, 2026 13:533,27557,077,89624,864,0001,989,0002,404,352
6Mar 20, 2026 13:533,40154,985,01725,897,0001,992,0002,314,240
7Mar 20, 2026 05:0421,206199,603,041170,890,0002,998,0002,396,160
8Mar 20, 2026 05:0421,238198,037,214170,152,0004,003,0002,392,064
9Mar 20, 2026 05:0421,268202,449,137170,387,0004,009,0002,424,832
10Mar 20, 2026 13:5321,329195,849,087171,903,0002,998,0002,445,312
11Mar 20, 2026 13:5321,337198,090,164170,962,0003,999,0002,494,464
12Mar 20, 2026 13:5321,427197,562,706171,711,0003,993,0002,396,160