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 21:44M-RochatM-RochatScore: 6,824Success
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 21:446,73165,285,99053,817,0002,055,0002,113,536
2May 21, 2026 21:446,74665,513,96853,947,0002,045,0002,113,536
3May 21, 2026 21:446,75867,047,53654,023,0002,072,0002,113,536
4May 21, 2026 21:446,77969,425,64954,159,0002,112,0002,113,536
5May 21, 2026 21:446,82466,615,46854,582,0002,065,0002,113,536
6May 21, 2026 21:446,83666,571,23254,587,0002,156,0002,113,536
7May 21, 2026 21:446,84167,077,77954,719,0002,064,0002,113,536
8May 21, 2026 21:446,87568,195,29954,898,0002,166,0002,113,536
9May 21, 2026 21:446,88668,012,33454,962,0002,196,0002,113,536