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:03Yuriy 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:0300000Error: expected "429496471324 ", got "98 [4294959848 4294959883 4294959894 4294959954 4294959982 4294960021 4294960032 4294960038 4294960052 4294960107 4294960215 4294960331 4294960356 4294960612 4294960858 4294960914 4294960938 4294960968 4294961189 4...