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 listDec 6, 2025 15:08Rajarshi BasuRajarshi BasuScore: 6,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:086,18274,547,45549,296,0002,012,0002,289,664
2Dec 6, 2025 15:086,18776,908,71650,342,0001,006,0002,269,184
3Dec 6, 2025 15:086,19372,090,61349,386,0002,015,0002,269,184
4Dec 6, 2025 15:086,19378,234,70049,389,0002,015,0002,289,664
5Dec 6, 2025 15:086,19472,900,82050,400,0001,008,0002,363,392
6Dec 6, 2025 15:086,19579,284,93751,415,00002,281,472
7Dec 6, 2025 15:086,19679,173,45049,407,0002,016,0002,281,472
8Dec 6, 2025 15:086,21379,019,02949,549,0002,022,0002,289,664
9Dec 6, 2025 15:086,31578,024,23350,401,0002,016,0002,269,184
10Dec 6, 2025 15:086,32879,739,59751,513,0001,010,0002,265,088
11Dec 6, 2025 15:086,32978,755,61851,523,0001,010,0002,289,664
12Dec 6, 2025 15:086,35080,720,30050,713,0001,988,0002,269,184