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 30, 2026 09:31Victor MerckléVictor MerckléScore: 112,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 09:32112,239940,740,040917,366,0002,997,0002,490,368stderr
2Apr 30, 2026 09:32112,423939,838,253918,870,0002,999,0002,387,968stderr
3Apr 30, 2026 09:32112,495942,485,314919,461,0002,998,0002,326,528stderr
4Apr 30, 2026 09:32112,545937,759,592920,870,0001,999,0002,555,904stderr
5Apr 30, 2026 09:32112,680943,856,289918,983,0004,999,0002,506,752stderr
6Apr 30, 2026 09:32112,843943,431,095922,322,0002,997,0002,445,312stderr
7Apr 30, 2026 09:32112,899946,258,511921,775,0003,999,0002,351,104stderr
8Apr 30, 2026 09:32112,925948,382,480919,991,0005,999,0002,412,544stderr
9Apr 30, 2026 09:32113,313947,743,870927,176,0001,998,0002,347,008stderr