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 20, 2026 05:43M-RochatM-RochatScore: 12,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:4412,456112,915,761101,061,0002,325,0002,113,536
2May 20, 2026 05:4412,457114,483,012101,373,0002,023,0002,113,536
3May 20, 2026 05:4412,470112,857,908101,166,0002,335,0002,113,536
4May 20, 2026 05:4412,476113,215,037101,223,0002,332,0002,113,536
5May 20, 2026 05:4412,485112,925,292101,592,0002,036,0002,113,536
6May 20, 2026 05:4412,490114,884,659101,325,0002,348,0002,113,536
7May 20, 2026 05:4412,506114,015,512101,790,0002,014,0002,113,536
8May 20, 2026 05:4412,522113,925,448101,929,0002,009,0002,113,536
9May 20, 2026 05:4412,523113,384,304101,604,0002,339,0002,113,536