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 16, 2026 22:38izotoffizotoffScore: 140,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:38139,46578,957,90549,579,0002,023,0002,383,872
2Mar 16, 2026 22:38140,04674,031,43451,817,00002,404,352
3Mar 16, 2026 22:38140,49280,900,82847,984,0003,998,0002,387,968