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:37wnwnScore: 3,386Success
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:383,36042,766,28526,828,0001,066,0002,494,464
2May 7, 2026 10:383,37345,698,04826,936,0001,063,0002,482,176
3May 7, 2026 10:383,37843,607,64226,978,0001,060,0002,482,176
4May 7, 2026 10:383,38342,824,17027,013,0001,070,0002,482,176
5May 7, 2026 10:383,38643,344,96127,033,0001,077,0002,486,272
6May 7, 2026 10:383,39943,103,70227,153,0001,064,0002,486,272
7May 7, 2026 10:383,41044,272,22627,236,0001,071,0002,498,560
8May 7, 2026 10:383,54944,860,17628,347,0001,111,0002,473,984
9May 7, 2026 10:383,55744,992,49728,433,0001,092,0002,486,272