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 11, 2024 00:29Joad NacerJoad NacerScore: 5,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 00:295,84373,741,50746,480,0002,020,0002,334,720
2Oct 11, 2024 00:295,85680,928,83046,581,0002,025,0002,510,848
3Oct 11, 2024 00:295,88176,829,55746,819,0001,992,0002,510,848
4Oct 11, 2024 00:295,97475,633,03348,575,0001,011,0002,330,624
5Oct 11, 2024 00:295,97482,571,47047,564,0002,024,0002,330,624
6Oct 11, 2024 00:295,97674,915,11248,590,0001,012,0002,330,624