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 listJun 21, 2026 06:51Elijah KinElijah KinScore: 66,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 06:5266,71633,673,61923,586,0001,099,0002,113,536
2Jun 21, 2026 06:5266,80533,732,02823,588,0001,130,0002,113,536
3Jun 21, 2026 06:5266,87533,766,01323,639,0001,105,0002,113,536
4Jun 21, 2026 06:5266,92733,699,21523,649,0001,114,0002,113,536
5Jun 21, 2026 06:5266,96233,783,19223,662,0001,114,0002,113,536
6Jun 21, 2026 06:5267,17533,875,72423,818,0001,037,0002,113,536
7Jun 21, 2026 06:5267,22933,896,70223,757,0001,118,0002,113,536
8Jun 21, 2026 06:5267,37534,012,35923,908,0001,021,0002,113,536
9Jun 21, 2026 06:5267,42133,997,14123,923,0001,023,0002,113,536