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 4, 2026 04:18olliecrowolliecrowScore: 12,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 02:3812,206123,415,96097,090,0003,002,0002,412,544
2Mar 4, 2026 02:3812,213127,478,96498,147,0002,003,0002,433,024
3Mar 4, 2026 02:4412,216126,800,31299,167,0001,001,0002,424,832
4Mar 4, 2026 02:4412,218128,266,95997,181,0003,005,0002,449,408
5Mar 4, 2026 04:1812,221127,362,33299,208,0001,002,0002,424,832
6Mar 4, 2026 04:1812,231124,849,12197,289,0003,008,0002,453,504
7Mar 4, 2026 04:1812,243125,819,07898,388,0002,007,0002,453,504
8Mar 4, 2026 02:4412,259130,652,31399,518,0001,005,0002,441,216
9Mar 4, 2026 02:3812,277127,007,05399,672,000996,0002,490,368