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 26, 2024 22:45Yuriy LyfenkoYuriy LyfenkoScore: 62,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2024 22:4562,494595,708,09423,122,87102,248,704
2Jul 26, 2024 22:4562,555589,412,78023,145,24402,285,568
3Jul 26, 2024 22:4562,696591,654,62123,197,64802,289,664