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:45Eric CeglieEric CeglieScore: 26,665Success
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:4526,643244,313,705219,139,0002,001,0002,514,944
2Mar 13, 2026 12:4526,644246,728,338219,142,0002,001,0002,285,568
3Mar 13, 2026 12:4526,648245,743,409219,178,0002,001,0002,519,040
4Mar 13, 2026 12:4526,653241,891,070219,216,0002,001,0002,277,376
5Mar 13, 2026 12:4526,665251,596,020219,316,0002,002,0002,285,568
6Mar 13, 2026 12:4526,677242,353,624220,421,0001,001,0002,514,944
7Mar 13, 2026 12:4526,684247,930,229220,480,000997,0002,359,296
8Mar 13, 2026 12:4526,684247,221,548221,479,00002,519,040
9Mar 13, 2026 12:4526,706252,433,291219,661,0001,996,0002,285,568