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 22, 2026 02:03izotoffizotoffScore: 78,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 02:0376,70351,189,13425,340,0003,040,0002,338,816
2Mar 22, 2026 02:0378,60058,186,08227,077,0002,005,0002,355,200
3Mar 22, 2026 02:0380,95959,149,74127,958,0001,997,0002,330,624