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:48wnwnScore: 3,470Success
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:483,38144,310,91926,994,0001,071,0002,490,368
2May 7, 2026 08:483,38541,797,84927,016,0001,080,0002,490,368
3May 7, 2026 08:483,40342,560,61827,175,0001,071,0002,490,368
4May 7, 2026 08:483,42645,793,11127,357,0001,080,0002,490,368
5May 7, 2026 08:483,47044,850,05527,715,0001,093,0002,486,272
6May 7, 2026 08:483,47743,703,03327,778,0001,084,0002,473,984
7May 7, 2026 08:483,57843,989,95228,598,0001,100,0002,482,176
8May 7, 2026 08:483,58144,701,28628,644,0001,086,0002,482,176
9May 7, 2026 08:483,62546,845,81828,955,0001,137,0002,482,176