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 24, 2026 08:00Dominique GarmierDominique GarmierScore: 7,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:007,51181,947,27059,328,0003,016,0002,437,120
2Apr 24, 2026 08:007,55082,973,62760,651,0002,021,0002,428,928
3Apr 24, 2026 08:007,55783,366,91259,744,0002,987,0002,441,216
4Apr 24, 2026 08:007,56279,302,95359,779,0002,988,0002,342,912
5Apr 24, 2026 08:007,57883,705,96859,903,0002,995,0002,437,120
6Apr 24, 2026 08:007,58483,268,22060,957,0001,998,0002,514,944
7Apr 24, 2026 08:007,59180,170,30160,010,0003,000,0002,424,832
8Apr 24, 2026 08:007,60481,240,07361,118,0002,003,0002,342,912
9Apr 24, 2026 08:007,77181,080,07262,486,0002,015,0002,437,120