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 19:07Victor MerckléVictor MerckléScore: 76,251Success
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 19:0875,67837,223,68326,939,0001,062,0002,191,360
2Jun 24, 2026 19:0875,95937,331,56626,974,0001,131,0002,191,360
3Jun 24, 2026 19:0875,97237,297,19826,992,0001,118,0002,191,360
4Jun 24, 2026 19:0876,03537,307,97326,990,0001,143,0002,191,360
5Jun 24, 2026 19:0876,25137,443,37227,119,0001,094,0002,191,360
6Jun 24, 2026 19:0876,39437,372,90227,137,0001,129,0002,191,360
7Jun 24, 2026 19:0876,53237,484,56527,176,0001,141,0002,191,360
8Jun 24, 2026 19:0876,81337,623,86027,269,0001,152,0002,191,360
9Jun 24, 2026 19:0876,81637,659,15527,278,0001,144,0002,191,360