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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2024 19:097,87891,237,24564,382,0001,005,0002,433,024
2Oct 8, 2024 19:097,98488,295,15565,261,0001,004,0002,273,280
3Oct 8, 2024 19:098,67598,564,01571,001,0001,000,0002,531,328
4Oct 8, 2024 19:098,71691,782,71671,342,0001,004,0002,428,928
5Oct 8, 2024 19:098,77795,422,26271,837,0001,011,0002,531,328
6Oct 8, 2024 19:0916,946169,682,080140,649,00002,420,736