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 29, 2026 21:04IlyaIlyaScore: 59,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:0559,20031,406,90820,740,0001,164,0002,113,536
2Jun 29, 2026 21:0559,22131,422,53020,719,0001,193,0002,113,536
3Jun 29, 2026 21:0559,40031,902,26020,769,0001,209,0002,113,536
4Jun 29, 2026 21:0559,40831,463,61420,794,0001,187,0002,113,536
5Jun 29, 2026 21:0559,44531,958,41320,771,0001,224,0002,113,536
6Jun 29, 2026 21:0559,46232,897,18120,793,0001,208,0002,113,536
7Jun 29, 2026 21:0559,48631,987,20120,812,0001,198,0002,113,536
8Jun 29, 2026 21:0559,48931,522,10420,818,0001,193,0002,113,536
9Jun 29, 2026 21:0559,71632,731,79421,054,0001,041,0002,113,536