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 19, 2026 15:46Victor MerckléVictor MerckléScore: 5,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 15:465,87258,726,46547,715,0001,028,0002,113,536
2May 19, 2026 15:465,87558,123,96347,744,0001,020,0002,113,536
3May 19, 2026 15:465,87557,850,99347,748,0001,022,0002,113,536
4May 19, 2026 15:465,92756,958,78548,182,0001,020,0002,113,536
5May 19, 2026 15:465,99359,598,21248,713,0001,032,0002,113,536
6May 19, 2026 15:466,00157,570,91548,785,0001,031,0002,113,536
7May 19, 2026 15:466,09260,873,15249,553,0001,018,0002,113,536
8May 19, 2026 15:466,12258,672,85749,797,0001,021,0002,113,536
9May 19, 2026 15:466,14858,863,30950,010,0001,020,0002,113,536