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:18caandocaandoScore: 6,095Success
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:186,00279,875,49647,822,0001,992,0002,273,280
2Oct 23, 2025 19:186,02574,199,13748,006,0002,000,0002,523,136
3Oct 23, 2025 19:186,03282,595,23748,060,0002,002,0002,285,568
4Oct 23, 2025 19:186,09576,631,97249,580,0001,011,0002,285,568
5Oct 23, 2025 19:186,09779,078,55249,596,0001,012,0002,269,184
6Oct 23, 2025 19:186,13374,934,20348,911,0001,996,0002,265,088