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 18:30Andrew EpsteinAndrew EpsteinScore: 17,248Success
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 18:312,68330,782,95022,008,000020,480
2Sep 19, 2026 18:312,69130,887,12222,068,000020,480
3Sep 19, 2026 18:3117,182149,720,346140,895,000020,480
4Sep 19, 2026 18:3117,215149,890,765141,165,000020,480
5Sep 19, 2026 18:3117,248150,236,648141,437,000020,480
6Sep 19, 2026 18:3117,271150,376,599141,627,000020,480
7Sep 19, 2026 18:3117,757154,394,931145,608,000020,480
8Sep 19, 2026 18:3117,758154,426,058145,618,000020,480
9Sep 19, 2026 18:3118,432159,997,962151,147,000020,480