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 9, 2025 09:38Ashish AhujaAshish AhujaScore: 2,309,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 09:252,305,40319,178,262,39618,796,078,000338,767,0002,433,024
2Aug 9, 2025 09:302,306,04319,186,807,04318,780,378,000359,777,0002,420,736
3Aug 9, 2025 09:302,308,23219,202,485,91518,794,526,000363,797,0002,486,272
4Aug 9, 2025 09:252,309,15919,208,027,66218,791,257,000374,765,0002,433,024
5Aug 9, 2025 09:302,309,21519,210,610,09318,803,669,000362,819,0002,461,696
6Aug 9, 2025 09:382,310,51419,226,759,96118,803,477,000373,790,0002,408,448
7Aug 9, 2025 09:252,314,17319,252,315,96718,851,825,000355,807,0002,433,024
8Aug 9, 2025 09:382,314,95419,259,742,78118,864,353,000349,765,0002,433,024
9Aug 9, 2025 09:382,383,72619,823,927,23919,418,148,000366,776,0002,428,928