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 listNov 12, 2025 21:46izotoffizotoffScore: 135,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 21:46123,0801,033,646,267834,383,000174,870,0002,519,040
2Nov 12, 2025 21:46135,4371,141,841,317944,644,000165,937,0002,363,392
3Nov 12, 2025 21:46138,9691,170,178,193961,618,000177,929,0002,482,176