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 10, 2026 10:06wnwnScore: 3,555Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:063,38843,966,50827,026,0001,101,0002,482,176
2May 10, 2026 10:063,45743,090,78127,634,0001,067,0002,486,272
3May 10, 2026 10:063,53544,987,42528,257,0001,090,0002,482,176
4May 10, 2026 10:063,54647,565,06828,347,0001,092,0002,486,272
5May 10, 2026 10:063,55542,036,69428,461,0001,053,0002,478,080
6May 10, 2026 10:063,56143,602,83628,473,0001,084,0002,486,272
7May 10, 2026 10:063,56144,109,02028,506,0001,058,0002,490,368
8May 10, 2026 10:063,57147,907,98428,548,0001,094,0002,490,368
9May 10, 2026 10:063,58144,702,66728,609,0001,115,0002,490,368