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:14Ashish AhujaAshish AhujaScore: 11,607Success
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:1410,819113,235,04469,843,00019,955,0002,445,312
2Aug 26, 2025 09:1411,256121,947,42073,548,00019,877,0002,523,136
3Aug 26, 2025 09:1411,271117,701,09474,642,00018,909,0002,494,464
4Aug 26, 2025 09:1311,469125,686,34474,369,00020,823,0002,473,984
5Aug 26, 2025 09:1411,607121,179,15978,461,00017,877,0002,494,464
6Aug 26, 2025 09:1311,628121,501,05478,605,00017,910,0002,494,464
7Aug 26, 2025 09:1411,672121,758,53375,903,00020,973,0002,486,272
8Aug 26, 2025 09:1311,680128,034,13077,953,00018,988,0002,494,464
9Aug 26, 2025 09:1412,235134,722,68081,638,00019,911,0002,416,640