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 21:06caandocaandoScore: 6,043Success
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 21:065,96174,988,79948,464,0001,009,0002,265,088
2Oct 23, 2025 21:066,01168,573,83147,900,0001,995,0002,285,568
3Oct 23, 2025 21:066,02173,443,66547,979,0001,999,0002,519,040
4Oct 23, 2025 21:066,04372,646,52048,147,0002,006,0002,285,568
5Oct 23, 2025 21:066,05177,165,54649,216,0001,004,0002,285,568
6Oct 23, 2025 21:066,12872,695,03450,865,00002,285,568