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 15:31IlyaIlyaScore: 60,432Success
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 15:3259,99131,818,00821,011,0001,186,0002,113,536
2Jun 30, 2026 15:3260,01031,768,61520,999,0001,205,0002,113,536
3Jun 30, 2026 15:3260,07533,075,69021,108,0001,120,0002,113,536
4Jun 30, 2026 15:3260,09131,860,62921,033,0001,201,0002,113,536
5Jun 30, 2026 15:3260,43232,284,80721,141,0001,219,0002,113,536
6Jun 30, 2026 15:3260,47532,287,45921,180,0001,196,0002,113,536
7Jun 30, 2026 15:3260,80231,990,02121,351,0001,146,0002,113,536
8Jun 30, 2026 15:3261,48132,710,90621,535,0001,213,0002,113,536
9Jun 30, 2026 15:3261,60032,723,31021,553,0001,239,0002,113,536