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 listFeb 16, 2026 17:48wnwnScore: 8,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:487,28080,617,06058,406,0002,014,0002,355,200
2Feb 16, 2026 17:487,46189,962,74758,933,0002,996,0002,502,656
3Feb 16, 2026 17:487,49379,756,42357,175,0005,015,0002,473,984
4Feb 16, 2026 17:488,37399,117,00266,472,0003,021,0002,445,312
5Feb 16, 2026 17:488,41393,375,43466,835,0002,992,0002,396,160
6Feb 16, 2026 17:488,747102,633,93969,574,0003,024,0002,408,448