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 15, 2026 14:35caandocaandoScore: 4,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:364,80164,393,42237,856,0001,992,0002,285,568
2Mar 15, 2026 14:354,82361,781,18039,027,0001,000,0002,285,568
3Mar 15, 2026 14:364,82561,746,53638,045,0002,002,0002,490,368
4Mar 15, 2026 14:354,84364,060,08938,191,0002,010,0002,285,568
5Mar 15, 2026 14:364,84968,701,11338,233,0002,012,0002,486,272
6Mar 15, 2026 14:354,93667,206,25438,967,0001,998,0002,478,080