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 listMar 4, 2026 03:27olliecrowolliecrowScore: 75,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:2774,90058,447,35927,713,00002,277,376
2Mar 4, 2026 03:2775,21453,942,73226,836,000993,0002,277,376
3Mar 4, 2026 03:2775,46557,278,87225,928,0001,994,0002,408,448