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 listSep 10, 2025 19:43Aleksei ShahoikaAleksei ShahoikaScore: 170,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2025 19:43169,81687,620,59861,835,000997,0002,269,184
2Sep 10, 2025 19:43170,41684,520,21461,053,0002,001,0002,265,088
3Sep 10, 2025 19:43170,48484,737,15261,077,0002,002,0002,375,680