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 19, 2026 15:18Andrew EpsteinAndrew EpsteinScore: 30,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:1930,204258,232,074245,670,0002,010,0002,117,632stderr
2Sep 19, 2026 15:1930,293259,599,605245,395,0003,011,0002,117,632stderr
3Sep 19, 2026 15:1930,351259,242,172245,875,0003,005,0002,117,632stderr
4Sep 19, 2026 15:1930,359260,077,604245,889,0003,060,0002,117,632stderr
5Sep 19, 2026 15:1930,530260,773,979247,278,0003,072,0002,117,632stderr
6Sep 19, 2026 15:1930,702262,777,303248,700,0003,057,0002,117,632stderr
7Sep 19, 2026 15:1930,708262,931,461248,615,0003,193,0002,117,632stderr
8Sep 19, 2026 15:1930,780262,763,864249,258,0003,146,0002,117,632stderr
9Sep 19, 2026 15:1930,860263,602,311249,851,0003,203,0002,117,632stderr