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 listMay 22, 2024 13:45AnupamAnupamScore: 1,646,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 13:451,646,77813,730,330,78813,668,253,43202,396,160
2May 22, 2024 13:451,646,85213,722,974,52613,668,868,75102,252,800
3May 22, 2024 13:451,649,53413,759,255,67013,691,131,85602,260,992