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 listMar 17, 2026 09:36limanjun99limanjun99Score: 8,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 09:368,26797,419,29966,599,0002,018,0002,289,664
2Mar 17, 2026 09:368,33095,131,62767,139,0002,004,0002,281,472
3Mar 17, 2026 09:368,34094,733,90767,213,0002,006,0002,289,664
4Mar 17, 2026 09:368,35092,472,20067,295,0002,008,0002,289,664
5Mar 17, 2026 09:368,36790,039,86067,435,0002,012,0002,289,664
6Mar 17, 2026 09:368,37590,992,22369,509,00002,363,392
7Mar 17, 2026 09:368,41095,188,51667,807,0001,994,0002,502,656
8Mar 17, 2026 09:368,41196,381,80568,815,000997,0002,289,664
9Mar 17, 2026 09:368,43294,417,89566,988,0002,999,0002,289,664