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 13, 2026 18:44M-RochatM-RochatScore: 19,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:4419,556173,025,746161,289,0001,026,0002,113,536
2May 13, 2026 18:4419,568171,119,344161,376,0001,045,0002,113,536
3May 13, 2026 18:4419,572171,565,817161,421,0001,032,0002,113,536
4May 13, 2026 18:4419,618171,765,161161,823,0001,014,0002,113,536
5May 13, 2026 18:4419,686172,096,839162,370,0001,025,0002,113,536
6May 13, 2026 18:4419,780172,964,560163,151,0001,024,0002,113,536
7May 13, 2026 18:4419,792173,920,346163,265,0001,011,0002,113,536
8May 13, 2026 18:4419,946176,079,145164,531,0001,028,0002,113,536
9May 13, 2026 18:4420,381179,589,957168,149,0001,021,0002,113,536