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 7, 2024 21:09Joad NacerJoad NacerScore: 8,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 21:097,34688,877,07359,973,000999,0002,433,024
2Oct 7, 2024 21:097,42091,294,83160,573,0001,009,0002,433,024
3Oct 7, 2024 21:097,44896,243,50259,824,0001,994,0002,273,280
4Oct 7, 2024 21:098,21291,592,96067,156,0001,002,0002,428,928
5Oct 7, 2024 21:098,25089,771,40967,469,0001,007,0002,428,928
6Oct 7, 2024 21:098,26292,678,63868,576,00002,428,928