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 21:37TonyTonyScore: 9,936Success
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 21:379,84291,670,45178,946,0002,745,0002,113,536
2Aug 2, 2026 21:379,87491,972,14979,861,0002,100,0002,113,536
3Aug 2, 2026 21:379,88992,827,38879,794,0002,288,0002,113,536
4Aug 2, 2026 21:379,92693,137,49480,250,0002,136,0002,113,536
5Aug 2, 2026 21:379,93692,461,32380,297,0002,177,0002,113,536
6Aug 2, 2026 21:379,97893,338,74680,737,0002,083,0002,113,536
7Aug 2, 2026 21:379,99593,695,11780,874,0002,087,0002,113,536
8Aug 2, 2026 21:3710,25295,801,35683,006,0002,088,0002,113,536
9Aug 2, 2026 21:3710,32597,931,42083,569,0002,133,0002,113,536