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:41Rajarshi BasuRajarshi BasuScore: 16,811Success
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:4116,557164,392,313122,378,00015,046,0002,502,656
2Dec 6, 2025 08:4116,811169,710,955127,483,00012,045,0002,494,464
3Dec 6, 2025 08:4116,957170,833,640126,769,00013,974,0002,473,984