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:51wnwnScore: 3,566Success
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:513,53944,658,72528,275,0001,100,0002,486,272
2May 7, 2026 08:513,54447,240,35928,332,0001,084,0002,494,464
3May 7, 2026 08:513,56145,127,65728,499,0001,065,0002,486,272
4May 7, 2026 08:513,56344,386,40728,500,0001,076,0002,494,464
5May 7, 2026 08:513,56645,374,18428,468,0001,131,0002,469,888
6May 7, 2026 08:513,56743,658,65228,560,0001,050,0002,490,368
7May 7, 2026 08:513,57245,240,82728,574,0001,079,0002,482,176
8May 7, 2026 08:513,57646,950,21328,603,0001,082,0002,478,080
9May 7, 2026 08:513,59944,164,36928,788,0001,089,0002,478,080