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 17, 2025 08:32Ashish AhujaAshish AhujaScore: 15,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 08:3215,597158,192,669118,504,00010,954,0002,338,816
2Aug 17, 2025 08:3215,832163,918,330116,472,00014,932,0002,347,008
3Aug 17, 2025 08:3215,906156,578,299120,016,00012,001,0002,342,912
4Aug 17, 2025 08:3215,951159,241,456120,447,00011,945,0002,301,952
5Aug 17, 2025 08:3215,981161,909,346118,679,00013,962,0002,342,912
6Aug 17, 2025 08:3216,368171,722,501123,865,00011,986,0002,342,912