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 22:53A_ShamanA_ShamanScore: 72,186Success
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 22:5471,71835,689,20525,492,0001,044,0002,113,536
2Jun 21, 2026 22:5471,84335,812,74125,533,0001,049,0002,113,536
3Jun 21, 2026 22:5471,85635,827,86925,543,0001,044,0002,113,536
4Jun 21, 2026 22:5472,05636,699,20825,613,0001,048,0002,113,536
5Jun 21, 2026 22:5472,18636,334,78425,659,0001,050,0002,113,536
6Jun 21, 2026 22:5472,23235,958,28025,681,0001,045,0002,113,536
7Jun 21, 2026 22:5472,23735,998,53025,683,0001,045,0002,113,536
8Jun 21, 2026 22:5472,54336,446,02925,793,0001,048,0002,113,536
9Jun 21, 2026 22:5472,96436,640,19125,947,0001,050,0002,113,536