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 13:28Joad NacerJoad NacerScore: 4,495Success
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 13:284,48355,849,36635,194,0002,011,0002,334,720
2Oct 11, 2024 13:284,48457,064,32334,203,0003,017,0002,334,720
3Oct 11, 2024 13:284,49465,534,68334,275,0003,024,0002,334,720
4Oct 11, 2024 13:284,49558,798,59136,302,0001,008,0002,441,216
5Oct 11, 2024 13:284,49560,023,53436,297,0001,008,0002,506,752
6Oct 11, 2024 13:284,56357,269,37635,880,0001,993,0002,326,528
7Oct 11, 2024 13:284,56769,593,97035,911,0001,995,0002,330,624
8Oct 11, 2024 13:284,56862,640,93235,920,0001,995,0002,510,848
9Oct 11, 2024 13:284,59264,045,29635,105,0003,009,0002,334,720