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 21:23IlyaIlyaScore: 60,178Success
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 21:2659,86431,597,71721,038,0001,112,0002,113,536
2Jun 29, 2026 21:2660,03231,669,06221,035,0001,177,0002,113,536
3Jun 29, 2026 21:2660,08931,773,89021,124,0001,109,0002,113,536
4Jun 29, 2026 21:2660,16231,686,03521,076,0001,184,0002,113,536
5Jun 29, 2026 21:2660,17831,744,82321,052,0001,214,0002,113,536
6Jun 29, 2026 21:2660,22131,731,58421,137,0001,145,0002,113,536
7Jun 29, 2026 21:2660,23732,190,28721,076,0001,212,0002,113,536
8Jun 29, 2026 21:2660,54531,878,89721,278,0001,124,0002,113,536
9Jun 29, 2026 21:2660,56432,371,47521,162,0001,247,0002,113,536