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 24, 2026 19:31Victor MerckléVictor MerckléScore: 78,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:3278,21338,066,07227,655,0001,284,0002,113,536
2Jun 24, 2026 19:3278,21638,070,07727,653,0001,287,0002,113,536
3Jun 24, 2026 19:3278,24038,004,53327,650,0001,299,0002,113,536
4Jun 24, 2026 19:3278,24538,046,05927,657,0001,294,0002,113,536
5Jun 24, 2026 19:3278,25138,059,90427,673,0001,280,0002,113,536
6Jun 24, 2026 19:3278,41638,130,25227,701,0001,313,0002,113,536
7Jun 24, 2026 19:3278,80038,295,12227,850,0001,306,0002,113,536
8Jun 24, 2026 19:3278,80838,273,42427,850,0001,309,0002,113,536
9Jun 24, 2026 19:3279,04038,341,33727,991,0001,254,0002,113,536