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 listJul 9, 2026 07:04Victor MerckléVictor MerckléScore: 2,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 07:052,86431,552,39822,476,0001,016,0002,117,632stderr
2Jul 9, 2026 07:052,86531,533,88122,377,0001,123,0002,117,632stderr
3Jul 9, 2026 07:052,87231,628,18422,531,0001,021,0002,117,632stderr
4Jul 9, 2026 07:052,87531,615,51322,465,0001,116,0002,117,632stderr
5Jul 9, 2026 07:052,87731,557,40922,577,0001,021,0002,117,632stderr
6Jul 9, 2026 07:052,88731,711,50522,557,0001,117,0002,117,632stderr
7Jul 9, 2026 07:0511,647103,539,39494,473,0001,034,0002,117,632stderr
8Jul 9, 2026 07:0511,679103,758,44994,752,0001,023,0002,117,632stderr
9Jul 9, 2026 07:0512,075107,014,43197,845,0001,172,0002,117,632stderr