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 listAug 18, 2026 14:06Victor MerckléVictor MerckléScore: 3,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 14:093,11234,012,35123,436,0002,088,0002,142,208stderr
2Aug 18, 2026 14:093,11934,021,12323,539,0002,039,0002,142,208stderr
3Aug 18, 2026 14:093,14734,168,03023,780,0002,027,0002,142,208stderr
4Aug 18, 2026 14:093,16634,534,34623,936,0002,027,0002,142,208stderr
5Aug 18, 2026 14:093,22734,926,89124,379,0002,088,0002,142,208stderr
6Aug 18, 2026 14:0912,604111,814,724101,280,0002,075,0002,142,208stderr
7Aug 18, 2026 14:0912,679112,453,123101,810,0002,161,0002,142,208stderr
8Aug 18, 2026 14:0912,681112,419,839101,858,0002,128,0002,142,208stderr
9Aug 18, 2026 14:0912,708112,670,481102,085,0002,127,0002,142,208stderr