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:47Eric CeglieEric CeglieScore: 28,228Success
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 12:3628,183264,668,714231,923,0001,999,0002,260,992
2Mar 13, 2026 12:4728,206261,371,141233,109,0001,000,0002,260,992
3Mar 13, 2026 12:3628,207262,300,577233,122,0001,000,0002,387,968
4Mar 13, 2026 12:3628,216263,675,060233,191,0001,000,0002,260,992
5Mar 13, 2026 12:3628,220256,247,206233,222,0001,000,0002,256,896
6Mar 13, 2026 12:3628,221259,648,928234,234,00002,387,968
7Mar 13, 2026 12:4728,228259,627,263233,292,0001,001,0002,379,776
8Mar 13, 2026 12:3628,231256,039,652234,321,00002,260,992
9Mar 13, 2026 12:3628,237261,498,711233,368,0001,001,0002,519,040
10Mar 13, 2026 12:4728,244263,718,092233,425,0001,001,0002,387,968
11Mar 13, 2026 12:3628,245255,881,113233,429,0001,001,0002,379,776
12Mar 13, 2026 12:3628,257263,242,352234,537,00002,260,992