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 14, 2024 00:15zielajzielajScore: 6,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:155,65468,887,46435,275,00011,086,0002,355,200
2Oct 14, 2024 00:155,66575,868,12734,333,00012,117,0002,412,544
3Oct 14, 2024 00:155,81172,251,04335,485,00012,166,0002,363,392
4Oct 14, 2024 00:156,01775,268,06834,233,00015,103,0002,486,272
5Oct 14, 2024 00:156,12178,751,00328,108,00022,085,0002,457,600
6Oct 14, 2024 00:156,12378,477,10234,141,00016,066,0002,342,912
7Oct 14, 2024 00:156,22978,457,99533,048,00018,026,0002,449,408
8Oct 14, 2024 00:156,23075,976,61334,056,00017,028,0002,490,368
9Oct 14, 2024 00:156,42478,679,33337,479,00015,194,0002,359,296