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:49M-RochatM-RochatScore: 12,549Success
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:4912,459114,054,596101,080,0002,336,0002,113,536
2May 20, 2026 05:4912,473113,619,754101,182,0002,344,0002,113,536
3May 20, 2026 05:4912,493113,085,016101,631,0002,061,0002,113,536
4May 20, 2026 05:4912,518113,688,633101,856,0002,044,0002,113,536
5May 20, 2026 05:4912,549114,845,705102,101,0002,058,0002,113,536
6May 20, 2026 05:4912,550115,702,767102,103,0002,067,0002,113,536
7May 20, 2026 05:4912,552115,950,769102,174,0002,010,0002,113,536
8May 20, 2026 05:4912,567114,679,062102,260,0002,050,0002,113,536
9May 20, 2026 05:4912,572117,087,893102,302,0002,048,0002,113,536