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 listJan 13, 2026 00:15Josu San MartinJosu San MartinScore: 70,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:1569,94952,729,49523,891,0001,990,0002,363,392
2Jan 13, 2026 00:1570,18949,299,16025,970,00002,375,680
3Jan 13, 2026 00:1570,57847,014,53824,106,0002,008,0002,449,408