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 listSep 3, 2026 06:08Josu San MartinJosu San MartinScore: 3,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:093,31737,130,51426,156,0001,047,0002,117,632
2Sep 3, 2026 06:093,33538,428,00326,287,0001,068,0002,117,632
3Sep 3, 2026 06:093,34837,429,34526,425,0001,030,0002,117,632
4Sep 3, 2026 06:093,35737,491,42026,501,0001,032,0002,117,632
5Sep 3, 2026 06:093,35938,206,95726,518,0001,031,0002,117,632
6Sep 3, 2026 06:093,36637,897,31226,535,0001,073,0002,117,632
7Sep 3, 2026 06:093,37137,625,22226,617,0001,033,0002,117,632
8Sep 3, 2026 06:0911,414103,566,76192,590,0001,010,0002,117,632
9Sep 3, 2026 06:0911,426103,622,95392,682,0001,016,0002,117,632