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:47Joad NacerJoad NacerScore: 7,970Success
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:477,89187,578,48964,491,0001,007,0002,334,720
2Oct 10, 2024 20:477,89687,900,03863,524,0002,016,0002,334,720
3Oct 10, 2024 20:477,96589,604,73664,106,0002,003,0002,510,848
4Oct 10, 2024 20:477,97085,730,52065,149,0001,002,0002,330,624
5Oct 10, 2024 20:477,98285,260,24263,241,0003,011,0002,330,624
6Oct 10, 2024 20:477,99789,158,34064,365,0002,011,0002,330,624