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 02:05Joad NacerJoad NacerScore: 4,646Success
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 02:054,56959,822,57835,924,0001,995,0002,506,752
2Oct 11, 2024 02:054,58061,293,26735,017,0003,001,0002,510,848
3Oct 11, 2024 02:054,58261,166,15835,031,0003,002,0002,506,752
4Oct 11, 2024 02:054,64663,886,64037,544,0001,014,0002,330,624
5Oct 11, 2024 02:054,67163,463,07936,780,0001,988,0002,506,752
6Oct 11, 2024 02:054,67758,931,88736,831,0001,990,0002,330,624