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 listOct 23, 2025 19:25caandocaandoScore: 6,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 19:255,88179,489,51546,822,0001,992,0002,285,568
2Oct 23, 2025 19:255,90873,058,02247,032,0002,001,0002,285,568
3Oct 23, 2025 19:255,91576,067,66447,092,0002,003,0002,285,568
4Oct 23, 2025 19:256,00079,152,19048,807,000996,0002,265,088
5Oct 23, 2025 19:256,02580,479,54648,007,0002,000,0002,523,136
6Oct 23, 2025 19:256,02872,879,51648,034,0002,001,0002,285,568