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:42Joad NacerJoad NacerScore: 7,967Success
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:427,78795,426,86263,625,0001,009,0002,510,848
2Oct 10, 2024 20:427,81588,289,42262,873,0001,995,0002,334,720
3Oct 10, 2024 20:427,89186,124,48364,487,0001,007,0002,334,720
4Oct 10, 2024 20:427,96793,593,87463,124,0003,005,0002,330,624
5Oct 10, 2024 20:427,97692,037,46063,192,0003,009,0002,506,752
6Oct 10, 2024 20:427,98087,230,49464,231,0002,007,0002,330,624