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 11, 2025 16:37Ian MckibbenIan MckibbenScore: 15,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 16:3715,457149,486,416128,294,00002,424,832
2Aug 11, 2025 16:3715,481151,716,758128,492,00002,437,120
3Aug 11, 2025 16:3715,489160,001,934128,558,00002,269,184
4Aug 11, 2025 16:3715,492152,667,655128,586,00002,510,848
5Aug 11, 2025 16:3715,890159,467,380130,889,000999,0002,433,024
6Aug 11, 2025 16:3715,900154,878,496130,970,000999,0002,531,328
7Aug 11, 2025 16:3715,905154,267,793131,015,0001,000,0002,531,328
8Aug 11, 2025 16:3715,951153,882,606131,393,0001,003,0002,510,848
9Aug 11, 2025 16:3715,982163,348,915131,653,000997,0002,531,328