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:21Rajarshi BasuRajarshi BasuScore: 17,357Success
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:2117,145167,756,256128,271,00014,029,0002,506,752
2Dec 6, 2025 08:2117,357174,127,450130,059,00014,006,0002,383,872
3Dec 6, 2025 08:2118,962182,336,194144,355,00013,032,0002,265,088