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 3, 2026 12:38A_ShamanA_ShamanScore: 70,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 12:3970,08935,622,79424,774,0001,159,0002,113,536
2Jul 3, 2026 12:3970,09735,493,58324,815,0001,121,0002,113,536
3Jul 3, 2026 12:3970,10835,476,17424,778,0001,162,0002,113,536
4Jul 3, 2026 12:3970,28335,574,79424,819,0001,186,0002,113,536
5Jul 3, 2026 12:3970,28636,001,31924,829,0001,177,0002,113,536
6Jul 3, 2026 12:3970,43736,042,23224,856,0001,206,0002,113,536
7Jul 3, 2026 12:3970,53236,105,15124,896,0001,201,0002,113,536
8Jul 3, 2026 12:3970,56736,131,66324,906,0001,204,0002,113,536
9Jul 3, 2026 12:3970,60535,974,32224,941,0001,183,0002,113,536