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 19:31Andrew EpsteinAndrew EpsteinScore: 17,347Success
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 19:322,65830,571,70121,803,000024,576stderr
2Sep 19, 2026 19:322,66230,627,80521,829,000024,576stderr
3Sep 19, 2026 19:3217,111149,026,560140,311,000024,576stderr
4Sep 19, 2026 19:3217,204149,762,519141,077,000024,576stderr
5Sep 19, 2026 19:3217,347151,043,431142,246,000024,576stderr
6Sep 19, 2026 19:3217,732154,171,912145,404,000024,576stderr
7Sep 19, 2026 19:3217,832155,120,708146,225,000024,576stderr
8Sep 19, 2026 19:3217,869155,394,598146,533,000024,576stderr
9Sep 19, 2026 19:3218,351159,273,297150,480,000024,576stderr