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:06Rajarshi BasuRajarshi BasuScore: 15,508Success
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:0614,802151,331,666110,874,00011,986,0002,465,792
2Dec 5, 2025 21:0615,508163,169,039114,748,00013,969,0002,314,240
3Dec 5, 2025 21:0616,424172,575,636122,288,00014,033,0002,457,600