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 listAug 15, 2026 00:40Tomislav TunkovicTomislav TunkovicScore: 2,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 00:412,66730,444,41020,757,0001,118,0002,113,536
2Aug 15, 2026 00:412,67830,185,16620,836,0001,131,0002,113,536
3Aug 15, 2026 00:412,68030,543,93920,851,0001,133,0002,113,536
4Aug 15, 2026 00:412,68130,494,20720,863,0001,126,0002,113,536
5Aug 15, 2026 00:412,68530,264,54221,010,0001,015,0002,113,536
6Aug 15, 2026 00:412,69330,563,05920,964,0001,124,0002,113,536
7Aug 15, 2026 00:412,70330,706,63621,142,0001,024,0002,113,536
8Aug 15, 2026 00:412,75531,896,65621,468,0001,128,0002,113,536
9Aug 15, 2026 00:412,98533,042,70723,302,0001,179,0002,113,536