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 20, 2025 19:31Adam FolwarcznyAdam FolwarcznyScore: 20,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2025 19:3120,959197,735,223171,957,0001,999,0002,531,328
2Aug 20, 2025 19:3120,962191,858,684171,986,0001,999,0002,441,216
3Aug 20, 2025 19:3120,967197,157,151172,030,0002,000,0002,531,328
4Aug 20, 2025 19:3120,969199,127,887172,046,0002,000,0002,445,312
5Aug 20, 2025 19:3120,982194,721,164173,152,0001,000,0002,269,184
6Aug 20, 2025 19:3121,365201,992,092176,327,0001,001,0002,445,312
7Aug 20, 2025 19:3121,366197,442,934176,335,0001,001,0002,527,232
8Aug 20, 2025 19:3121,371200,253,176176,381,0001,002,0002,433,024
9Aug 20, 2025 19:3122,014208,077,488180,717,0001,996,0002,531,328