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 7, 2026 10:10wnwnScore: 3,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:113,41544,260,31027,279,0001,069,0002,478,080
2May 7, 2026 10:113,41644,030,50727,281,0001,078,0002,494,464
3May 7, 2026 10:113,41745,517,61627,288,0001,081,0002,478,080
4May 7, 2026 10:113,42344,360,66627,349,0001,067,0002,494,464
5May 7, 2026 10:113,42847,249,24827,374,0001,082,0002,490,368
6May 7, 2026 10:113,45943,369,14227,618,0001,096,0002,494,464
7May 7, 2026 10:113,54355,219,37928,250,0001,158,0002,469,888
8May 7, 2026 10:113,61445,126,57428,892,0001,106,0002,478,080
9May 7, 2026 10:113,63044,034,46429,042,0001,092,0002,478,080