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 11, 2026 15:34caandocaandoScore: 5,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 15:345,11167,412,09039,390,0003,030,0002,285,568
2Mar 11, 2026 15:345,13968,826,75240,624,0002,031,0002,478,080
3Mar 11, 2026 15:345,55067,992,78842,056,0004,005,0002,318,336