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 listAug 31, 2025 20:44Adam FolwarcznyAdam FolwarcznyScore: 80,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 20:4479,9401,421,654,46947,106,000616,396,000389,120
2Aug 31, 2025 20:4480,0391,440,427,38449,098,000615,228,000360,448
3Aug 31, 2025 20:4484,1871,427,313,06249,138,000649,613,000360,448