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 08:29wnwnScore: 3,590Success
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 08:293,41242,591,61927,254,0001,067,0002,494,464
2May 7, 2026 08:293,41944,994,66827,279,0001,101,0002,486,272
3May 7, 2026 08:293,58344,601,37528,654,0001,086,0002,486,272
4May 7, 2026 08:293,59047,898,73128,703,0001,096,0002,486,272
5May 7, 2026 08:293,59044,698,51328,741,0001,061,0002,482,176
6May 7, 2026 08:293,59446,004,92128,732,0001,105,0002,490,368
7May 7, 2026 08:293,60345,313,74628,828,0001,078,0002,486,272
8May 7, 2026 08:293,62145,630,07028,964,0001,094,0002,478,080
9May 7, 2026 08:293,62347,483,69428,981,0001,094,0002,494,464