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 listMar 19, 2026 06:20Genos0Genos0Score: 71,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 06:2071,212615,909,849534,051,00057,005,0002,383,872
2Mar 19, 2026 06:2071,278621,573,488533,643,00057,961,0002,273,280
3Mar 19, 2026 06:2071,386620,550,093537,553,00054,954,0002,375,680