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 listApr 27, 2026 05:46wnwnScore: 3,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:463,48142,027,33526,902,0001,992,0002,486,272
2Apr 27, 2026 05:463,48444,967,78326,926,0001,994,0002,498,560
3Apr 27, 2026 05:463,48647,607,32726,941,0001,995,0002,490,368
4Apr 27, 2026 05:463,49547,028,07427,978,0001,036,0002,486,272
5Apr 27, 2026 05:463,59347,456,03027,834,0001,988,0002,498,560
6Apr 27, 2026 05:463,61446,637,87727,999,0001,999,0002,490,368
7Apr 27, 2026 05:463,62146,173,87228,052,0002,003,0002,486,272
8Apr 27, 2026 05:463,63847,656,21529,197,0001,006,0002,494,464
9Apr 27, 2026 05:463,65548,061,46929,326,0001,011,0002,478,080