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 13, 2026 12:03highload-churnerhighload-churnerScore: 42,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 12:0442,710359,362,678348,809,0001,415,00028,672stderr
2Oct 13, 2026 12:0442,711359,734,343348,778,0001,454,00028,672stderr
3Oct 13, 2026 12:0442,744359,523,875348,942,0001,566,00028,672stderr
4Oct 13, 2026 12:0442,782359,734,076349,328,0001,492,00028,672stderr
5Oct 13, 2026 12:0442,793360,283,910349,482,0001,426,00028,672stderr
6Oct 13, 2026 12:0442,805360,036,181349,553,0001,455,00028,672stderr
7Oct 13, 2026 12:0442,805360,038,924349,549,0001,452,00028,672stderr
8Oct 13, 2026 12:0442,814360,093,018349,597,0001,480,00028,672stderr
9Oct 13, 2026 12:0442,820360,266,615349,635,0001,494,00028,672stderr