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 14, 2026 18:05Elijah KinElijah KinScore: 67,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 18:0567,418591,612,693493,622,00065,949,0002,285,568
2Mar 14, 2026 18:0567,474586,258,920491,032,00069,004,0002,260,992
3Mar 14, 2026 18:0567,510586,362,196490,294,00070,042,0002,285,568
4Mar 14, 2026 18:0567,583585,861,202502,943,00057,993,0002,265,088
5Mar 14, 2026 18:0567,583582,466,357498,950,00061,993,0002,363,392
6Mar 14, 2026 18:0567,618591,673,401505,204,00056,022,0002,265,088
7Mar 14, 2026 18:0567,664588,704,375516,646,00044,969,0002,285,568
8Mar 14, 2026 18:0567,674590,523,340506,722,00054,969,0002,285,568
9Mar 14, 2026 18:0567,783586,761,707499,644,00062,955,0002,260,992