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:39Ashish AhujaAshish AhujaScore: 11,395Success
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:3911,132118,760,80476,499,00015,895,0002,424,832
2Aug 26, 2025 09:3911,228121,291,87972,375,00020,820,0002,371,584
3Aug 26, 2025 09:3911,278117,469,92475,684,00017,925,0002,490,368
4Aug 26, 2025 09:3911,395117,662,74372,676,00021,902,0002,408,448
5Aug 26, 2025 09:3911,493129,008,11573,535,00021,861,0002,310,144
6Aug 26, 2025 09:3911,971130,468,20080,479,00018,877,0002,478,080