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:02Rajarshi BasuRajarshi BasuScore: 22,233Success
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:0220,387199,118,522158,198,00011,013,0002,478,080
2Dec 5, 2025 21:0222,233214,143,453171,497,00013,037,0002,486,272
3Dec 5, 2025 21:0222,720219,794,083176,538,00012,036,0002,437,120