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 listMay 20, 2026 06:21M-RochatM-RochatScore: 47,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:2647,478403,197,731391,993,0002,078,0002,129,920
2May 20, 2026 06:2647,488405,108,014391,964,0002,188,0002,129,920
3May 20, 2026 06:2647,490404,380,742392,004,0002,163,0002,129,920
4May 20, 2026 06:2647,495403,370,323392,066,0002,144,0002,129,920
5May 20, 2026 06:2647,503403,982,090392,211,0002,065,0002,129,920
6May 20, 2026 06:2647,511404,067,706392,280,0002,063,0002,129,920
7May 20, 2026 06:2647,513403,541,937392,183,0002,182,0002,129,920
8May 20, 2026 06:2647,514403,513,298392,220,0002,154,0002,129,920
9May 20, 2026 06:2650,181437,041,664394,023,00022,480,0002,129,920