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 10, 2026 16:43caandocaandoScore: 5,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:434,99467,373,92440,438,0001,010,0002,519,040
2Mar 10, 2026 16:435,04069,268,06638,842,0002,987,0002,285,568
3Mar 10, 2026 16:435,04074,376,53740,835,000995,0002,285,568
4Mar 10, 2026 16:435,04368,638,96540,834,0001,020,0002,285,568
5Mar 10, 2026 16:435,04467,391,67939,873,0001,993,0002,367,488
6Mar 10, 2026 16:435,05663,475,22438,969,0002,997,0002,285,568