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 19:54IlyaIlyaScore: 60,962Success
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 19:5560,66731,966,02021,303,0001,144,0002,113,536
2Jun 29, 2026 19:5560,75932,064,93621,351,0001,130,0002,113,536
3Jun 29, 2026 19:5560,85131,975,45221,400,0001,115,0002,113,536
4Jun 29, 2026 19:5560,93232,641,86121,307,0001,238,0002,113,536
5Jun 29, 2026 19:5560,96232,309,34121,368,0001,188,0002,113,536
6Jun 29, 2026 19:5561,03532,509,18021,388,0001,195,0002,113,536
7Jun 29, 2026 19:5561,16732,588,44321,446,0001,186,0002,113,536
8Jun 29, 2026 19:5561,18632,532,41321,446,0001,193,0002,113,536
9Jun 29, 2026 19:5561,25933,443,07121,626,0001,040,0002,113,536