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:13Andrew EpsteinAndrew EpsteinScore: 39,538Success
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:1439,096331,076,837317,540,0003,052,0002,117,632stderr
2Sep 19, 2026 15:1439,163332,272,588318,063,0003,080,0002,117,632stderr
3Sep 19, 2026 15:1439,396335,518,117319,928,0003,124,0002,117,632stderr
4Sep 19, 2026 15:1439,504334,445,880321,922,0002,012,0002,117,632stderr
5Sep 19, 2026 15:1439,538335,290,522321,209,0003,009,0002,117,632stderr
6Sep 19, 2026 15:1439,589335,111,873321,612,0003,023,0002,117,632stderr
7Sep 19, 2026 15:1439,682336,452,492322,201,0003,195,0002,117,632stderr
8Sep 19, 2026 15:1439,918337,834,801324,193,0003,142,0002,117,632stderr
9Sep 19, 2026 15:1440,075339,692,290325,545,0003,074,0002,117,632stderr