Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 16, 2026 19:17wnwnScore: 8,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:177,53085,418,85459,479,0003,024,0002,260,992
2Feb 16, 2026 19:177,53185,768,44959,482,0003,024,0002,412,544
3Feb 16, 2026 19:177,58884,855,13157,981,0004,998,0002,293,760
4Feb 16, 2026 19:178,62898,469,36466,568,0005,043,0002,400,256
5Feb 16, 2026 19:178,714100,721,20268,306,0004,018,0002,297,856
6Feb 16, 2026 19:178,83597,031,26768,305,0005,022,0002,437,120