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 00:59Joad NacerJoad NacerScore: 7,733Success
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 00:597,50884,767,29159,304,0003,015,0002,523,136
2Oct 11, 2024 00:597,51280,860,09760,335,0002,011,0002,514,944
3Oct 11, 2024 00:597,53086,527,55862,495,00002,523,136
4Oct 11, 2024 00:597,73386,769,22163,184,0001,002,0002,330,624
5Oct 11, 2024 00:597,73483,051,04263,192,0001,003,0002,510,848
6Oct 11, 2024 00:597,73582,691,64761,194,0003,009,0002,330,624