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 listSep 6, 2026 12:19Kevin HeaveyKevin HeaveyScore: 3,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:213,50439,115,30227,869,0001,222,0002,113,536
2Sep 6, 2026 12:213,53237,878,07628,107,0001,214,0002,113,536
3Sep 6, 2026 12:213,54039,626,32128,313,0001,074,0002,113,536
4Sep 6, 2026 12:213,54037,912,21828,187,0001,202,0002,113,536
5Sep 6, 2026 12:213,55938,068,09428,509,0001,036,0002,113,536
6Sep 6, 2026 12:213,56037,982,55528,490,0001,061,0002,113,536
7Sep 6, 2026 12:213,56339,715,27028,396,0001,185,0002,113,536
8Sep 6, 2026 12:213,56437,943,59928,378,0001,207,0002,113,536
9Sep 6, 2026 12:213,72040,598,40529,840,0001,039,0002,113,536