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 21:02Adam FolwarcznyAdam FolwarcznyScore: 59,514Success
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 21:0259,487518,331,647491,744,0001,998,0002,404,352
2Sep 17, 2025 21:0259,514524,213,408492,965,000999,0002,269,184
3Sep 17, 2025 21:0259,583527,689,964492,543,0001,998,0002,269,184