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 listMar 19, 2026 23:44olliecrowolliecrowScore: 18,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 23:4418,580174,683,807147,342,0005,011,0002,310,144
2Mar 19, 2026 23:4418,625179,632,176149,731,0002,994,0002,367,488
3Mar 19, 2026 23:4418,678180,416,089150,158,0003,003,0002,387,968