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 listDec 6, 2025 08:12Rajarshi BasuRajarshi BasuScore: 14,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 08:1214,103150,789,262104,049,00013,006,0002,371,584
2Dec 6, 2025 08:1214,217143,791,693102,003,00016,000,0002,473,984
3Dec 6, 2025 08:1215,239154,545,005112,433,00014,054,0002,510,848