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 7, 2026 23:10Nikita SmirnovNikita SmirnovScore: 64,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 23:1064,304556,454,613490,744,00042,977,0002,285,568
2Feb 7, 2026 23:1064,320561,407,324477,871,00055,984,0002,289,664
3Feb 7, 2026 23:1064,320558,576,924490,870,00042,988,0002,289,664
4Feb 7, 2026 23:1064,434563,269,269452,835,00081,970,0002,289,664
5Feb 7, 2026 23:1064,469561,386,649473,081,00062,010,0002,306,048
6Feb 7, 2026 23:1064,568557,653,958470,928,00064,990,0002,297,856
7Feb 7, 2026 23:1064,574561,880,376465,971,00069,995,0002,301,952
8Feb 7, 2026 23:1064,616562,489,669497,365,00038,950,0002,301,952
9Feb 7, 2026 23:1064,630561,790,617480,387,00056,045,0002,289,664