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 listApr 27, 2026 15:04Victor MerckléVictor MerckléScore: 78,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 15:0578,43245,781,91026,018,0003,002,0002,523,136
2Apr 27, 2026 15:0578,50546,872,77227,044,0002,003,0002,514,944
3Apr 27, 2026 15:0578,52450,865,97527,051,0002,003,0002,519,040
4Apr 27, 2026 15:0578,58648,856,82928,075,0001,002,0002,519,040
5Apr 27, 2026 15:0578,75446,659,48825,120,0004,019,0002,514,944
6Apr 27, 2026 15:0578,76246,755,16227,133,0002,009,0002,519,040
7Apr 27, 2026 15:0578,76444,073,01925,124,0004,019,0002,527,232
8Apr 27, 2026 15:0578,92748,722,09127,189,0002,014,0002,523,136
9Apr 27, 2026 15:0579,11643,587,62927,255,0002,018,0002,523,136