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 26, 2026 13:58wnwnScore: 3,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:093,43348,228,90927,480,0001,017,0002,330,624
2Apr 26, 2026 14:093,44544,367,75627,579,0001,021,0002,330,624
3Apr 26, 2026 14:093,45446,078,24027,649,0001,024,0002,494,464
4Apr 26, 2026 14:093,45547,191,25827,654,0001,024,0002,551,808
5Apr 26, 2026 14:093,46045,148,07027,694,0001,025,0002,494,464
6Apr 26, 2026 14:093,48346,626,76126,918,0001,993,0002,482,176
7Apr 26, 2026 14:093,53643,447,12228,341,0001,012,0002,486,272
8Apr 26, 2026 14:093,61843,810,62828,029,0002,002,0002,490,368
9Apr 26, 2026 14:093,66547,129,62129,413,0001,014,0002,490,368