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 listDec 8, 2024 14:47MatthiasMatthiasScore: 8,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 14:478,93395,002,15572,137,0002,003,0002,285,568
2Dec 8, 2024 14:478,970103,177,96073,446,0001,006,0002,273,280
3Dec 8, 2024 14:478,97597,859,30074,494,00002,285,568
4Dec 8, 2024 14:478,984106,421,55173,561,0001,007,0002,273,280
5Dec 8, 2024 14:478,98499,233,06073,558,0001,007,0002,285,568
6Dec 8, 2024 14:479,008102,634,13373,773,000996,0002,387,968