TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 8, 2021 19:02Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:0200000Error: expected "429496530294 ", got "84 [4294963810 4294965204 4294966995 4294964036 4294965851 4294963851 4294962638 4294966927 4294964797 4294966963 4294964620 4294967255 4294966947 4294962804 4294964442 4294966825 4294965601 4294965274 4294963728 4...