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 listFeb 6, 2025 13:54mebowlermebowlerScore: 89,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 13:5489,883770,312,334744,033,0002,000,0002,498,560
2Feb 6, 2025 13:5489,941773,674,892744,513,0001,998,0002,285,568
3Feb 6, 2025 13:5490,164781,864,538747,361,0001,000,0002,494,464