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 13, 2026 12:43Eric CeglieEric CeglieScore: 27,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:2627,946256,230,543230,953,000999,0002,265,088
2Mar 13, 2026 12:4327,956259,005,783231,038,0001,000,0002,285,568
3Mar 13, 2026 12:4327,957256,065,121230,045,0002,000,0002,514,944
4Mar 13, 2026 14:2627,958260,620,354230,048,0002,000,0002,265,088
5Mar 13, 2026 12:4327,959257,680,793230,062,0002,000,0002,277,376
6Mar 13, 2026 14:2627,963256,953,651231,091,0001,000,0002,285,568
7Mar 13, 2026 12:4327,965260,197,765230,110,0002,000,0002,285,568
8Mar 13, 2026 12:4327,971261,997,776231,161,0001,000,0002,363,392
9Mar 13, 2026 12:4327,977259,626,600230,210,0002,001,0002,265,088
10Mar 13, 2026 12:4327,984260,225,415230,262,0002,002,0002,514,944
11Mar 13, 2026 12:4327,987258,479,643230,290,0002,002,0002,260,992
12Mar 13, 2026 12:4327,994256,938,356231,346,0001,001,0002,285,568