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 10, 2024 20:39Joad NacerJoad NacerScore: 8,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 20:398,682100,155,43570,056,0002,001,0002,510,848
2Oct 10, 2024 20:398,69093,105,29970,127,0002,003,0002,334,720
3Oct 10, 2024 20:398,70098,394,78270,201,0002,005,0002,510,848
4Oct 10, 2024 20:398,864105,047,99572,567,0001,007,0002,510,848
5Oct 10, 2024 20:398,879100,566,34773,693,00002,330,624
6Oct 10, 2024 20:398,89798,101,41071,854,0001,995,0002,330,624