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 5, 2025 21:12Rajarshi BasuRajarshi BasuScore: 14,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 21:1214,672145,857,135106,803,00014,972,0002,437,120
2Dec 5, 2025 21:1214,684144,248,354110,892,00010,989,0002,478,080
3Dec 5, 2025 21:1214,837145,388,034110,130,00013,015,0002,490,368