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 1, 2026 21:08C21C21Score: 4,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 21:094,27245,597,25233,955,0001,078,0002,117,632stderr
2Oct 1, 2026 21:094,28245,647,19834,046,0001,072,0002,117,632stderr
3Oct 1, 2026 21:094,28545,729,71233,065,0002,079,0002,117,632stderr
4Oct 1, 2026 21:094,32046,155,60533,255,0002,171,0002,117,632stderr
5Oct 1, 2026 21:094,34446,216,67233,445,0002,181,0002,117,632stderr
6Oct 1, 2026 21:094,41147,425,90933,987,0002,186,0002,117,632stderr
7Oct 1, 2026 21:0915,652138,918,787114,262,00014,090,0002,117,632stderr
8Oct 1, 2026 21:0915,702139,960,022114,883,00013,878,0002,121,728stderr
9Oct 1, 2026 21:0915,898141,036,080115,192,00015,175,0002,117,632stderr