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 19, 2026 22:04M-RochatM-RochatScore: 40,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 22:0540,789350,727,316279,340,00059,212,0002,113,536
2May 19, 2026 22:0540,804348,176,874279,026,00059,650,0002,113,536
3May 19, 2026 22:0540,806350,900,337279,043,00059,650,0002,113,536
4May 19, 2026 22:0540,818349,720,989279,245,00059,550,0002,113,536
5May 19, 2026 22:0540,830348,699,619278,847,00060,046,0002,113,536
6May 19, 2026 22:0540,839350,037,786279,103,00059,865,0002,113,536
7May 19, 2026 22:0540,859348,471,964279,034,00060,100,0002,113,536
8May 19, 2026 22:0540,887353,641,895279,057,00060,312,0002,117,632
9May 19, 2026 22:0540,919348,845,489279,400,00060,231,0002,113,536