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 30, 2026 10:37IlyaIlyaScore: 62,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:3962,05932,529,07821,830,0001,132,0002,113,536
2Jun 30, 2026 10:3962,18632,479,14621,912,0001,097,0002,113,536
3Jun 30, 2026 10:3962,22432,513,20921,909,0001,114,0002,113,536
4Jun 30, 2026 10:3962,36232,650,81421,896,0001,178,0002,113,536
5Jun 30, 2026 10:3962,37032,955,84421,867,0001,210,0002,113,536
6Jun 30, 2026 10:3962,45932,559,35121,993,0001,117,0002,113,536
7Jun 30, 2026 10:3962,46233,124,89721,878,0001,233,0002,113,536
8Jun 30, 2026 10:3962,52732,570,73521,953,0001,182,0002,113,536
9Jun 30, 2026 10:3962,75933,092,80222,022,0001,199,0002,113,536