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 listAug 31, 2024 16:31TuetuopayTuetuopayScore: 55,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 23:5955,410527,469,522459,900,08802,232,320
2Jul 28, 2024 23:5955,441528,625,976460,162,61602,232,320
3Aug 31, 2024 16:3155,470489,804,744459,399,0001,000,0002,375,680
4Aug 31, 2024 16:3155,481489,191,564460,490,00002,371,584
5Jul 28, 2024 23:5955,485527,193,147460,525,65002,359,296
6Aug 31, 2024 16:3155,786485,871,014462,021,0001,000,0002,281,472