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 listJan 22, 2025 21:18Miriam VellacottMiriam VellacottScore: 129,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 21:18129,4961,097,044,6641,020,826,00053,990,0002,453,504
2Jan 22, 2025 21:18129,6921,100,225,2921,008,478,00067,964,0002,289,664
3Jan 22, 2025 21:18129,7001,102,738,733996,548,00079,963,0002,371,584
4Jan 22, 2025 21:18129,7931,106,011,6631,026,316,00050,966,0002,289,664
5Jan 22, 2025 21:18129,8301,100,626,0291,012,614,00064,975,0002,363,392
6Jan 22, 2025 21:18129,8611,104,268,1711,009,860,00067,990,0002,289,664
7Jan 22, 2025 21:18129,8641,103,791,9941,020,882,00056,993,0002,367,488
8Jan 22, 2025 21:18129,8831,105,364,2291,015,028,00063,001,0002,289,664
9Jan 22, 2025 21:18129,9001,112,207,3561,005,224,00072,943,0002,289,664