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 30, 2026 16:11IlyaIlyaScore: 60,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 16:1358,88131,293,95820,610,0001,176,0002,113,536
2Jun 30, 2026 16:1359,21331,838,73720,702,0001,207,0002,113,536
3Jun 30, 2026 16:1359,44331,837,81420,770,0001,224,0002,113,536
4Jun 30, 2026 16:1359,90532,669,00220,961,0001,204,0002,113,536
5Jun 30, 2026 16:1360,58132,383,21421,304,0001,111,0002,113,536
6Jun 30, 2026 16:1321,076,9547,809,030,1677,637,957,000160,516,0002,113,536
7Jun 30, 2026 16:1321,231,7517,865,470,7107,692,262,000163,486,0002,113,536
8Jun 30, 2026 16:1321,280,5167,883,469,8607,710,924,000162,867,0002,113,536
9Jun 30, 2026 16:1321,324,7137,899,922,8127,734,061,000156,083,0002,113,536