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 listMay 31, 2024 06:18GraceGraceScore: 8,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2024 06:188,539148,809,28370,869,58902,277,376
2May 31, 2024 06:188,539140,370,52370,874,47002,289,664
3May 31, 2024 06:188,541138,870,48170,886,16002,285,568
4May 31, 2024 06:188,542137,877,63970,900,49502,285,568
5May 31, 2024 06:188,547150,428,16370,941,95902,289,664
6May 31, 2024 06:188,555135,589,96071,007,91602,285,568
7May 31, 2024 06:188,577133,761,30571,185,43302,285,568
8May 31, 2024 06:188,586143,189,26271,267,66502,277,376
9May 31, 2024 06:188,592138,308,85471,313,29002,281,472