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 listSep 24, 2026 18:47Karthik ReddyKarthik ReddyScore: 33,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 18:4733,925291,757,728280,331,0001,249,0002,113,536
2Sep 24, 2026 18:4733,931291,886,953280,440,0001,192,0002,113,536
3Sep 24, 2026 18:4733,934291,876,547280,461,0001,196,0002,113,536
4Sep 24, 2026 18:4733,958292,122,752280,655,0001,197,0002,113,536
5Sep 24, 2026 18:4733,964292,170,215280,893,0001,015,0002,113,536
6Sep 24, 2026 18:4733,966292,260,802280,693,0001,231,0002,113,536
7Sep 24, 2026 18:4733,970292,490,326280,953,0001,001,0002,113,536
8Sep 24, 2026 18:4733,972292,360,720280,959,0001,009,0002,113,536
9Sep 24, 2026 18:4733,976292,384,962281,003,0001,002,0002,113,536