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 21, 2026 22:02M-RochatM-RochatScore: 6,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 22:026,58664,681,47852,601,0002,063,0002,113,536
2May 21, 2026 22:026,58864,053,52252,629,0002,054,0002,113,536
3May 21, 2026 22:026,59664,400,72152,689,0002,062,0002,113,536
4May 21, 2026 22:026,59866,893,87952,678,0002,090,0002,117,632
5May 21, 2026 22:026,59965,714,30552,613,0002,161,0002,113,536
6May 21, 2026 22:026,60365,805,10952,728,0002,078,0002,113,536
7May 21, 2026 22:026,60466,229,72752,733,0002,084,0002,113,536
8May 21, 2026 22:026,60864,539,18652,789,0002,060,0002,113,536
9May 21, 2026 22:026,61667,169,46652,862,0002,054,0002,113,536