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 21, 2026 23:00A_ShamanA_ShamanScore: 73,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 23:0173,48136,414,28926,144,0001,044,0002,113,536
2Jun 21, 2026 23:0173,54536,445,20426,168,0001,044,0002,113,536
3Jun 21, 2026 23:0173,62436,499,75626,195,0001,046,0002,113,536
4Jun 21, 2026 23:0173,69736,456,37526,226,0001,042,0002,113,536
5Jun 21, 2026 23:0173,72436,495,31426,234,0001,044,0002,113,536
6Jun 21, 2026 23:0173,92937,148,49126,311,0001,043,0002,113,536
7Jun 21, 2026 23:0174,21336,645,53526,415,0001,044,0002,113,536
8Jun 21, 2026 23:0174,26236,683,39526,434,0001,043,0002,113,536
9Jun 21, 2026 23:0174,54037,145,64926,532,0001,048,0002,113,536