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 listJul 22, 2026 17:56Kasper KivimäkiKasper KivimäkiScore: 58,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 17:5757,972491,226,633426,593,00054,581,0002,113,536
2Jul 22, 2026 17:5757,973492,023,832426,649,00054,534,0002,113,536
3Jul 22, 2026 17:5758,012491,553,252425,971,00055,533,0002,113,536
4Jul 22, 2026 17:5758,046492,347,110426,221,00055,569,0002,113,536
5Jul 22, 2026 17:5758,074492,567,373426,571,00055,450,0002,113,536
6Jul 22, 2026 17:5758,078492,577,973426,476,00055,575,0002,113,536
7Jul 22, 2026 17:5758,081492,554,821426,573,00055,506,0002,113,536
8Jul 22, 2026 17:5758,138492,434,790426,025,00056,525,0002,113,536
9Jul 22, 2026 17:5758,169492,929,401426,316,00056,493,0002,113,536