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 4, 2026 16:04caandocaandoScore: 5,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:045,34769,345,01143,370,0001,008,0002,285,568
2Mar 4, 2026 16:045,35369,865,21243,423,0001,009,0002,285,568
3Mar 4, 2026 16:045,39372,992,24042,770,0001,989,0002,285,568
4Mar 4, 2026 16:045,45174,990,19643,232,0002,010,0002,265,088
5Mar 4, 2026 16:045,45668,149,06843,276,0002,012,0002,285,568
6Mar 4, 2026 16:045,45977,793,66143,299,0002,013,0002,265,088