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 7, 2026 12:02IlyaIlyaScore: 59,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:0458,83731,411,25720,645,0001,125,0002,113,536
2Jul 7, 2026 12:0458,97231,524,00420,665,0001,155,0002,113,536
3Jul 7, 2026 12:0459,01633,053,10120,702,0001,134,0002,113,536
4Jul 7, 2026 12:0459,03731,468,18020,631,0001,213,0002,113,536
5Jul 7, 2026 12:0459,09431,556,70420,729,0001,136,0002,113,536
6Jul 7, 2026 12:0459,12731,537,12620,671,0001,206,0002,113,536
7Jul 7, 2026 12:0459,21031,593,06920,771,0001,137,0002,113,536
8Jul 7, 2026 12:0459,39431,682,00820,767,0001,209,0002,113,536
9Jul 7, 2026 12:0459,51032,259,07120,794,0001,225,0002,113,536