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:03wnwnScore: 3,443Success
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:033,37843,902,53726,986,0001,059,0002,486,272
2May 7, 2026 10:033,40543,299,73827,199,0001,066,0002,490,368
3May 7, 2026 10:033,40545,192,36727,182,0001,082,0002,486,272
4May 7, 2026 10:033,41744,648,27927,294,0001,070,0002,482,176
5May 7, 2026 10:033,44343,560,07727,487,0001,097,0002,482,176
6May 7, 2026 10:033,46044,721,33827,657,0001,067,0002,490,368
7May 7, 2026 10:033,56746,480,42328,528,0001,083,0002,490,368
8May 7, 2026 10:033,59343,964,16228,739,0001,084,0002,490,368
9May 7, 2026 10:033,60546,231,29228,817,0001,108,0002,482,176