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 20, 2024 08:21Javid izadiJavid izadiScore: 120,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2024 08:21120,0201,026,533,877994,170,0001,998,0002,465,792
2Dec 20, 2024 08:21120,0331,023,610,770994,278,0001,998,0002,371,584
3Dec 20, 2024 08:21120,0431,022,347,371994,361,0001,998,0002,367,488
4Dec 20, 2024 08:21120,0441,022,103,912995,365,0001,000,0002,285,568
5Dec 20, 2024 08:21120,0761,017,610,563994,634,0001,999,0002,375,680
6Dec 20, 2024 08:21120,0871,026,793,700995,726,000999,0002,363,392
7Dec 20, 2024 08:21120,0901,022,984,007995,749,000999,0002,445,312
8Dec 20, 2024 08:21120,1011,022,150,624996,835,00002,285,568
9Dec 20, 2024 08:21120,1081,022,145,364995,898,000999,0002,285,568