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 26, 2025 06:43Ashish AhujaAshish AhujaScore: 11,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 06:4311,093119,065,01277,221,00014,850,0002,441,216
2Aug 26, 2025 06:4311,228125,571,39676,340,00016,854,0002,396,160
3Aug 26, 2025 06:4311,447128,044,36875,010,00020,002,0002,482,176
4Aug 26, 2025 06:4311,506125,651,86881,571,00013,926,0002,482,176
5Aug 26, 2025 06:4311,524126,062,33174,728,00020,924,0002,478,080
6Aug 26, 2025 06:4314,975155,507,378102,415,00021,875,0002,461,696