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:13Dominique GarmierDominique GarmierScore: 7,747Success
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:137,60580,463,25460,118,0003,005,0002,347,008
2Apr 24, 2026 08:137,63981,670,97261,394,0002,012,0002,347,008
3Apr 24, 2026 08:137,73880,759,34362,222,0002,007,0002,351,104
4Apr 24, 2026 08:137,74285,559,89362,251,0002,008,0002,347,008
5Apr 24, 2026 08:137,74777,729,43162,295,0002,009,0002,347,008
6Apr 24, 2026 08:137,75684,181,65062,371,0002,011,0002,351,104
7Apr 24, 2026 08:137,76079,066,20062,403,0002,013,0002,351,104
8Apr 24, 2026 08:137,76486,900,21262,435,0002,014,0002,351,104
9Apr 24, 2026 08:137,77385,191,65162,507,0002,016,0002,351,104