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, 2023 20:37sliceteamsliceteamScore: 16,241Success
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, 2023 20:3715,365199,799,018127,527,56702,244,608
2Oct 8, 2023 20:3715,424187,800,182128,015,69902,265,088
3Oct 8, 2023 20:3715,450188,576,948128,233,81802,260,992
4Oct 8, 2023 20:3716,180161,112,419133,291,0001,002,0002,387,968
5Oct 8, 2023 20:3716,203155,299,763134,489,00002,260,992
6Oct 8, 2023 20:3716,214162,693,850132,581,0001,993,0002,383,872
7Oct 8, 2023 20:3716,241158,552,641134,798,00002,392,064
8Oct 8, 2023 20:3716,268163,237,229134,027,0001,000,0002,523,136
9Oct 8, 2023 20:3716,269161,582,644133,034,0002,000,0002,260,992
10Oct 8, 2023 20:3716,271164,225,618133,049,0002,000,0002,265,088
11Oct 8, 2023 20:3716,276160,375,454133,090,0002,001,0002,523,136
12Oct 8, 2023 20:3716,277167,213,214133,099,0002,001,0002,260,992