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 listApr 5, 2024 20:48Matt StuchlikMatt StuchlikScore: 31,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2024 20:5331,235321,293,668259,253,57502,293,760
2Apr 5, 2024 20:5331,236331,554,342259,261,63202,281,472
3Apr 5, 2024 20:4631,237317,433,707259,263,01702,289,664
4Apr 5, 2024 20:4631,238320,898,985259,278,78302,285,568
5Apr 5, 2024 20:4631,245322,048,073259,335,62802,277,376
6Apr 5, 2024 20:4831,249328,789,433259,367,93302,285,568
7Apr 5, 2024 20:5331,257343,802,042259,434,97302,285,568
8Apr 5, 2024 20:4831,259327,066,030259,452,46302,273,280
9Apr 5, 2024 20:4832,902327,948,964273,084,64802,281,472