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 13, 2026 21:39olliecrowolliecrowScore: 60,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 21:3960,28650,496,38520,279,0002,027,0002,273,280
2Mar 13, 2026 21:3960,43057,124,08520,327,0002,032,0002,408,448
3Mar 13, 2026 21:3960,66859,276,93822,447,00002,400,256