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 09:09Ashish AhujaAshish AhujaScore: 11,160Success
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 09:0910,839128,002,67470,973,00018,992,0002,506,752
2Aug 26, 2025 09:0910,859121,430,88273,295,00016,838,0002,494,464
3Aug 26, 2025 09:0911,047116,951,01672,752,00018,935,0002,297,856
4Aug 26, 2025 09:0911,160123,488,70272,706,00019,919,0002,502,656
5Aug 26, 2025 09:0911,223124,851,35980,266,00012,882,0002,486,272
6Aug 26, 2025 09:0911,318124,482,61272,186,00021,754,0002,506,752