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:53wnwnScore: 3,936Success
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:533,84447,548,64030,851,0001,055,0002,490,368
2May 10, 2026 10:533,84444,716,91030,860,0001,049,0002,486,272
3May 10, 2026 10:533,87747,468,23831,121,0001,059,0002,486,272
4May 10, 2026 10:533,92648,615,47331,490,0001,097,0002,478,080
5May 10, 2026 10:533,93649,926,05131,574,0001,098,0002,473,984
6May 10, 2026 10:534,20450,771,32233,846,0001,054,0002,478,080
7May 10, 2026 10:534,25352,831,55634,219,0001,084,0002,486,272
8May 10, 2026 10:534,25549,449,20534,247,0001,074,0002,486,272
9May 10, 2026 10:534,26448,496,79634,339,0001,059,0002,490,368