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 listOct 20, 2024 21:48gordgordScore: 293,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2024 21:50291,6972,449,988,7752,109,202,000311,882,0002,383,872
2Oct 20, 2024 21:50293,0892,459,247,8052,114,819,000317,822,0002,400,256
3Oct 20, 2024 21:48293,2382,458,899,0542,114,025,000319,852,0002,400,256
4Oct 20, 2024 21:50293,8982,466,291,3172,128,565,000310,790,0002,383,872
5Oct 20, 2024 21:48293,9022,471,227,6702,124,593,000314,791,0002,326,528
6Oct 20, 2024 21:48293,9032,470,786,9092,103,619,000335,779,0002,387,968