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 10:44Victor MerckléVictor MerckléScore: 64,675Success
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 10:4564,35431,277,18623,811,00002,113,536
2Jun 24, 2026 10:4564,48631,342,83723,860,00002,113,536
3Jun 24, 2026 10:4564,57531,370,10823,893,00002,113,536
4Jun 24, 2026 10:4564,62131,655,97223,910,00002,113,536
5Jun 24, 2026 10:4564,67531,408,61023,930,00002,113,536
6Jun 24, 2026 10:4564,89131,512,54024,010,00002,113,536
7Jun 24, 2026 10:4564,93731,602,96124,027,00002,113,536
8Jun 24, 2026 10:4564,97032,076,64324,039,00002,113,536
9Jun 24, 2026 10:4565,24332,136,21224,140,00002,113,536