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:04M-RochatM-RochatScore: 19,905Success
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:0519,582174,113,564161,500,0001,032,0002,113,536
2May 13, 2026 18:0519,583173,022,460161,459,0001,082,0002,113,536
3May 13, 2026 18:0519,630171,694,304161,878,0001,051,0002,113,536
4May 13, 2026 18:0519,656171,766,302162,113,0001,034,0002,113,536
5May 13, 2026 18:0519,905174,526,275164,188,0001,026,0002,113,536
6May 13, 2026 18:0519,923175,544,288164,342,0001,021,0002,113,536
7May 13, 2026 18:0519,927175,848,496164,352,0001,045,0002,113,536
8May 13, 2026 18:0519,960176,553,599164,655,0001,018,0002,113,536
9May 13, 2026 18:0520,030174,948,281165,209,0001,044,0002,113,536