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 30, 2026 07:49IlyaIlyaScore: 58,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:5058,87031,262,97220,661,0001,121,0002,113,536
2Jun 30, 2026 07:5058,87231,273,46320,661,0001,122,0002,113,536
3Jun 30, 2026 07:5058,93232,644,29220,688,0001,117,0002,113,536
4Jun 30, 2026 07:5058,96731,300,68120,719,0001,099,0002,113,536
5Jun 30, 2026 07:5058,98631,350,13220,709,0001,116,0002,113,536
6Jun 30, 2026 07:5059,05431,392,12420,687,0001,163,0002,113,536
7Jun 30, 2026 07:5059,07231,385,99520,736,0001,121,0002,113,536
8Jun 30, 2026 07:5059,11331,408,65820,756,0001,116,0002,113,536
9Jun 30, 2026 07:5059,17531,362,09620,790,0001,105,0002,113,536