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 listFeb 26, 2026 09:35lipapipalipapipaScore: 5,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 09:355,76071,905,00044,821,0002,988,0002,265,088
2Feb 26, 2026 09:355,79870,065,71345,118,0003,007,0002,367,488
3Feb 26, 2026 09:355,81974,912,04046,288,0002,012,0002,285,568
4Feb 26, 2026 09:355,88477,432,16046,847,0001,993,0002,310,144
5Feb 26, 2026 09:356,07575,230,01948,409,0002,017,0002,297,856
6Feb 26, 2026 09:356,14473,924,32247,994,0002,999,0002,523,136