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 14:10Victor MerckléVictor MerckléScore: 63,108Success
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 14:1162,85430,843,39423,256,00002,113,536
2Jun 24, 2026 14:1162,97230,766,27123,300,00002,113,536
3Jun 24, 2026 14:1162,99731,085,01122,279,0001,030,0002,113,536
4Jun 24, 2026 14:1163,00030,738,55423,310,00002,113,536
5Jun 24, 2026 14:1163,10831,055,90322,323,0001,027,0002,113,536
6Jun 24, 2026 14:1163,19731,014,33123,383,00002,113,536
7Jun 24, 2026 14:1163,34831,238,05722,427,0001,012,0002,113,536
8Jun 24, 2026 14:1163,39130,872,12622,418,0001,037,0002,113,536
9Jun 24, 2026 14:11616,248235,450,955228,012,00002,113,536