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 listOct 15, 2026 02:05highload-churnerhighload-churnerScore: 16,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 02:0616,802146,872,403136,771,0001,009,00024,576stderr
2Oct 15, 2026 02:0616,835147,107,541137,005,0001,044,00024,576stderr
3Oct 15, 2026 02:0616,854147,303,593137,203,0001,004,00024,576stderr
4Oct 15, 2026 02:0616,869147,433,556137,317,0001,010,00024,576stderr
5Oct 15, 2026 02:0616,911147,795,808137,672,0001,005,00024,576stderr
6Oct 15, 2026 02:0624,225207,667,646178,018,00020,629,00024,576stderr
7Oct 15, 2026 02:0624,666211,234,258182,745,00019,522,00024,576stderr
8Oct 15, 2026 02:0628,547243,203,192214,269,00019,823,00024,576stderr
9Oct 15, 2026 02:0640,136338,593,331310,258,00018,862,00024,576stderr