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 3, 2026 09:32RuszrokRuszrokScore: 494,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 09:32493,5264,124,911,0033,863,420,000232,844,0002,506,752
2Feb 3, 2026 09:32493,8904,127,902,5183,864,444,000234,844,0002,527,232
3Feb 3, 2026 09:32494,0154,131,617,0663,863,482,000236,845,0002,285,568
4Feb 3, 2026 09:32494,0564,125,186,8993,863,800,000236,865,0002,400,256
5Feb 3, 2026 09:32494,1354,128,597,5663,864,473,000236,845,0002,367,488
6Feb 3, 2026 09:32494,1474,124,497,2193,865,567,000235,851,0002,285,568
7Feb 3, 2026 09:32494,3774,130,683,3783,865,485,000237,845,0002,285,568
8Feb 3, 2026 09:32494,4034,129,556,3843,863,686,000239,856,0002,285,568
9Feb 3, 2026 09:32494,5484,132,191,4233,865,881,000238,869,0002,285,568