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 12:43Joad NacerJoad NacerScore: 9,614Success
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 12:438,18592,515,60965,936,0001,998,0002,420,736
2Oct 10, 2024 12:438,20290,005,81866,077,0002,002,0002,420,736
3Oct 10, 2024 12:438,20487,011,90567,092,0001,001,0002,273,280
4Oct 10, 2024 12:439,614105,766,23878,796,000997,0002,428,928
5Oct 10, 2024 12:439,637100,107,57577,987,0001,999,0002,433,024
6Oct 10, 2024 12:439,720107,818,86680,677,00002,428,928