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 listSep 17, 2025 20:52Adam FolwarcznyAdam FolwarcznyScore: 65,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 20:5265,520565,256,870476,840,00066,977,0002,379,776
2Sep 17, 2025 20:5265,579573,543,726478,387,00065,915,0002,281,472
3Sep 17, 2025 20:5265,817572,646,132480,368,00065,913,0002,379,776