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 1, 2026 10:01George SeabridgeGeorge SeabridgeScore: 8,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 1, 2026 10:017,12569,110,16058,061,0001,079,0002,113,536
2Aug 1, 2026 10:017,13069,164,80558,107,0001,080,0002,113,536
3Aug 1, 2026 10:017,13269,229,86758,104,0001,097,0002,113,536
4Aug 1, 2026 10:017,13269,236,00358,099,0001,097,0002,113,536
5Aug 1, 2026 10:018,21578,143,05667,054,0001,135,0002,113,536
6Aug 1, 2026 10:018,42580,673,49168,840,0001,091,0002,113,536
7Aug 1, 2026 10:018,43379,972,02068,908,0001,087,0002,113,536
8Aug 1, 2026 10:018,43579,996,08068,923,0001,094,0002,113,536
9Aug 1, 2026 10:018,44180,120,58768,932,0001,135,0002,113,536