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 listApr 14, 2025 12:42Yuriy LyfenkoYuriy LyfenkoScore: 59,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:4259,586547,746,36620,043,0002,004,0002,531,328
2Apr 14, 2025 12:4259,770543,481,93820,105,0002,010,0002,428,928
3Apr 14, 2025 12:4260,122541,718,02020,223,0002,022,0002,527,232