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 1, 2025 18:56Rajarshi BasuRajarshi BasuScore: 15,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 18:5615,315150,762,756125,111,0002,001,0002,379,776
2Dec 1, 2025 18:5615,349149,656,318126,390,0001,003,0002,371,584
3Dec 1, 2025 18:5615,395159,117,523125,780,0001,996,0002,375,680