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 listFeb 22, 2025 14:16alfaixalfaixScore: 155,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 14:16155,1041,309,964,5711,226,393,00060,969,0002,289,664
2Feb 22, 2025 14:16155,3031,315,975,7081,227,065,00061,952,0002,273,280
3Feb 22, 2025 14:16155,3121,310,442,9561,227,135,00061,956,0002,273,280
4Feb 22, 2025 14:16155,3321,311,987,1571,227,290,00061,964,0002,277,376
5Feb 22, 2025 14:16155,3881,317,636,1001,226,734,00062,986,0002,289,664
6Feb 22, 2025 14:16155,3891,313,247,5041,226,739,00062,986,0002,269,184
7Feb 22, 2025 14:16155,4281,321,628,9191,226,100,00063,953,0002,277,376
8Feb 22, 2025 14:16155,5781,317,357,8711,228,336,00062,965,0002,277,376
9Feb 22, 2025 14:16155,8071,316,865,1011,228,235,00064,959,0002,277,376