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 listAug 2, 2026 20:02TonyTonyScore: 9,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:039,49688,790,87176,642,0002,177,0002,113,536
2Aug 2, 2026 20:039,53088,974,47076,981,0002,124,0002,113,536
3Aug 2, 2026 20:039,53290,002,38976,939,0002,179,0002,113,536
4Aug 2, 2026 20:039,57089,250,65077,306,0002,132,0002,113,536
5Aug 2, 2026 20:039,58389,419,32577,393,0002,151,0002,113,536
6Aug 2, 2026 20:039,59689,486,37377,397,0002,256,0002,113,536
7Aug 2, 2026 20:039,59990,253,32877,513,0002,165,0002,113,536
8Aug 2, 2026 20:039,61389,705,98777,587,0002,206,0002,113,536
9Aug 2, 2026 20:039,63390,420,83577,793,0002,164,0002,113,536