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 listJul 2, 2026 22:11Victor MerckléVictor MerckléScore: 57,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 22:1256,79428,708,93621,014,00002,113,536
2Jul 2, 2026 22:1256,91629,374,63920,018,0001,041,0002,113,536
3Jul 2, 2026 22:1256,94028,841,99321,068,00002,113,536
4Jul 2, 2026 22:1256,95428,810,61520,036,0001,037,0002,113,536
5Jul 2, 2026 22:1257,02428,851,10620,067,0001,032,0002,113,536
6Jul 2, 2026 22:1257,06228,860,12220,079,0001,034,0002,113,536
7Jul 2, 2026 22:1257,10533,231,18220,124,0001,005,0002,113,536
8Jul 2, 2026 22:1257,11029,088,18220,124,0001,007,0002,113,536
9Jul 2, 2026 22:1257,13529,421,64820,118,0001,022,0002,113,536