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 listMar 24, 2026 07:26servant714servant714Score: 54,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:2654,587475,193,601397,060,00056,008,0002,273,280
2Mar 24, 2026 07:2654,654475,482,817393,678,00059,951,0002,273,280
3Mar 24, 2026 07:2654,727479,582,047398,202,00056,028,0002,281,472
4Mar 24, 2026 07:2654,733478,632,039398,250,00056,035,0002,281,472
5Mar 24, 2026 07:2654,744481,649,752399,333,00055,045,0002,281,472
6Mar 24, 2026 07:2654,770483,137,459394,642,00059,945,0002,281,472
7Mar 24, 2026 07:2654,776485,385,612400,683,00053,957,0002,273,280
8Mar 24, 2026 07:2654,801482,262,260397,869,00056,981,0002,437,120
9Mar 24, 2026 07:2654,834475,827,994398,110,00057,015,0002,433,024