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 17, 2025 13:52RyogaRyogaScore: 50,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 13:5250,419447,507,601418,476,00002,478,080
2Oct 17, 2025 13:5250,425441,249,803417,529,000998,0002,527,232
3Oct 17, 2025 13:5250,433447,760,168416,599,0001,998,0002,478,080
4Oct 17, 2025 13:5250,436448,515,522417,616,000999,0002,527,232
5Oct 17, 2025 13:5250,438442,962,049416,641,0001,998,0002,527,232
6Oct 17, 2025 13:5250,438445,944,941417,634,000999,0002,260,992
7Oct 17, 2025 13:5250,440443,980,546418,649,00002,523,136
8Oct 17, 2025 13:5250,441449,586,186418,657,00002,260,992
9Oct 17, 2025 13:5250,460440,195,041417,820,000999,0002,527,232