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 12, 2026 17:51Victor MerckléVictor MerckléScore: 9,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 17:519,42887,129,94677,140,0001,113,0002,113,536
2May 12, 2026 17:519,43690,229,30077,138,0001,183,0002,113,536
3May 12, 2026 17:519,43689,406,53277,149,0001,174,0002,113,536
4May 12, 2026 17:519,43688,258,52777,134,0001,188,0002,113,536
5May 12, 2026 17:519,44188,993,62477,179,0001,186,0002,113,536
6May 12, 2026 17:519,44287,822,65777,187,0001,182,0002,113,536
7May 12, 2026 17:519,44694,435,12977,404,0001,003,0002,113,536
8May 12, 2026 17:519,47090,510,09077,598,0001,005,0002,113,536
9May 12, 2026 17:519,56590,872,51478,202,0001,193,0002,113,536