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 19, 2026 03:24wnwnScore: 6,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:236,28079,707,74550,120,0002,004,0002,486,272
2Apr 19, 2026 03:236,30678,280,75251,331,0001,006,0002,498,560
3Apr 19, 2026 03:236,30874,208,41351,354,0001,006,0002,486,272
4Apr 19, 2026 03:246,32174,147,56751,457,0001,008,0002,494,464
5Apr 19, 2026 03:246,38074,004,05450,954,0001,998,0002,531,328
6Apr 19, 2026 03:246,51479,090,09752,066,0002,002,0002,531,328