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 listAug 16, 2026 18:56marko1597marko1597Score: 5,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 19:135,38053,014,78243,453,0001,201,0002,117,632
2Aug 16, 2026 19:135,39153,123,38343,726,0001,020,0002,117,632
3Aug 16, 2026 19:135,39553,208,55043,771,0001,013,0002,117,632
4Aug 16, 2026 19:135,43553,524,44244,053,0001,061,0002,117,632
5Aug 16, 2026 19:135,47453,846,78244,373,0001,067,0002,117,632
6Aug 16, 2026 19:137,45970,272,43260,839,0001,076,0002,117,632
7Aug 16, 2026 19:137,47870,679,30360,990,0001,079,0002,117,632
8Aug 16, 2026 19:137,48270,489,11361,102,0001,006,0002,117,632
9Aug 16, 2026 19:137,53173,025,88361,422,0001,088,0002,117,632