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 21, 2024 05:07rimuspprimusppScore: 91,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 05:0791,394782,230,350756,574,0001,998,0002,527,232
2Dec 21, 2024 05:0791,402785,220,100757,641,000999,0002,265,088
3Dec 21, 2024 05:0791,442786,526,952758,966,00002,473,984
4Dec 21, 2024 05:0791,449785,459,659759,026,00002,523,136
5Dec 21, 2024 05:0791,466780,428,382758,169,0001,000,0002,265,088
6Dec 21, 2024 05:0791,513785,580,348758,555,000999,0002,273,280
7Dec 21, 2024 05:0792,046785,756,592763,984,00002,523,136
8Dec 21, 2024 05:0792,089789,077,016764,340,00002,527,232
9Dec 21, 2024 05:0792,130784,946,749762,677,0001,999,0002,527,232