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 14, 2026 07:41Victor MerckléVictor MerckléScore: 60,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:4160,049508,614,904497,404,0001,003,0002,117,632stderr
2May 14, 2026 07:4160,091506,762,187497,760,0001,003,0002,117,632stderr
3May 14, 2026 07:4160,100508,976,867497,830,0001,004,0002,117,632stderr
4May 14, 2026 07:4160,114509,136,878497,948,0001,003,0002,117,632stderr
5May 14, 2026 07:4160,116507,457,330497,965,0001,004,0002,117,632stderr
6May 14, 2026 07:4160,167510,900,525498,390,0001,002,0002,117,632stderr
7May 14, 2026 07:4160,176507,135,179498,458,0001,003,0002,117,632stderr
8May 14, 2026 07:4160,190508,618,726498,580,0001,003,0002,117,632stderr
9May 14, 2026 07:4160,196509,913,178498,629,0001,004,0002,117,632stderr