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 11, 2026 18:08Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:09040,106,41031,600,0001,072,0002,113,536expected "53683426154751082 ", got "53683426952230538 "
2May 11, 2026 18:093,87341,201,01531,059,0001,094,0002,113,536
3May 11, 2026 18:093,88339,580,26331,135,0001,099,0002,113,536
4May 11, 2026 18:093,88741,176,95931,190,0001,073,0002,113,536
5May 11, 2026 18:093,89140,467,45231,214,0001,085,0002,113,536
6May 11, 2026 18:093,89641,882,67031,239,0001,099,0002,113,536
7May 11, 2026 18:093,91441,198,00431,404,0001,085,0002,113,536
8May 11, 2026 18:093,91639,792,60631,425,0001,078,0002,113,536
9May 11, 2026 18:093,97540,652,69531,909,0001,087,0002,113,536