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 listAug 28, 2026 16:21Victor MerckléVictor MerckléScore: 57,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:2257,36430,266,05520,185,0001,040,0002,113,536
2Aug 28, 2026 16:2257,42930,413,19620,208,0001,041,0002,113,536
3Aug 28, 2026 16:2257,44030,375,07420,251,0001,002,0002,113,536
4Aug 28, 2026 16:2257,47529,406,82520,228,0001,038,0002,113,536
5Aug 28, 2026 16:2257,47830,395,24120,257,0001,010,0002,113,536
6Aug 28, 2026 16:2257,52729,436,00321,285,00002,113,536
7Aug 28, 2026 16:2257,55930,399,14220,212,0001,085,0002,113,536
8Aug 28, 2026 16:2257,64330,981,72420,318,0001,010,0002,113,536
9Aug 28, 2026 16:2257,67529,444,62520,328,0001,012,0002,113,536