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, 2024 21:39zielajzielajError
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, 2024 21:3800000Error: Exit with code 1: not a dynamic executable 0 4294967295 50000000 100000000 1932735283 2362232011 43723641 11537437 1932735283 2362232011 6276359 11537437 2137748137 2195014367 5470967 2107970 2137748137 2195014367 805392 2107970 2155810094 216...stderr
2Oct 13, 2024 21:3915,048154,552,619116,374,0007,022,0002,334,720
3Oct 13, 2024 21:3915,162147,391,256104,273,00020,052,0002,514,944
4Oct 13, 2024 21:3915,394147,826,817109,202,00017,031,0002,371,584