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 listFeb 26, 2026 12:27Genos0Genos0Score: 75,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 12:2775,803653,495,655561,151,00068,018,0002,375,680
2Feb 26, 2026 12:2775,829655,752,604563,449,00065,935,0002,277,376
3Feb 26, 2026 12:2775,849652,556,014557,598,00071,948,0002,277,376