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 listSep 23, 2026 08:33Kevin HeaveyKevin HeaveyScore: 3,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:383,22135,583,05425,609,0001,128,0002,113,536
2Sep 23, 2026 08:383,22535,678,93925,603,0001,170,0002,113,536
3Sep 23, 2026 08:383,23835,612,59425,699,0001,177,0002,113,536
4Sep 23, 2026 08:383,24335,681,12225,903,0001,021,0002,113,536
5Sep 23, 2026 08:383,24535,771,67225,755,0001,180,0002,113,536
6Sep 23, 2026 08:383,25536,037,17425,862,0001,157,0002,113,536
7Sep 23, 2026 08:383,25735,865,18725,964,0001,070,0002,113,536
8Sep 23, 2026 08:383,26035,947,93525,925,0001,138,0002,113,536
9Sep 23, 2026 08:383,27036,715,77326,093,0001,048,0002,113,536