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 listJun 17, 2026 10:52DavidDavidScore: 60,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 10:5360,457510,874,178500,799,0001,002,0002,113,536
2Jun 17, 2026 10:5360,476511,026,917500,955,0001,003,0002,113,536
3Jun 17, 2026 10:5360,480510,979,662500,988,0001,004,0002,113,536
4Jun 17, 2026 10:5360,496511,355,209501,114,0001,003,0002,113,536
5Jun 17, 2026 10:5360,496511,367,668501,114,0001,003,0002,113,536
6Jun 17, 2026 10:5360,659512,563,515502,468,0001,002,0002,113,536
7Jun 17, 2026 10:5360,687512,852,194502,702,0001,004,0002,113,536
8Jun 17, 2026 10:5360,701512,802,953502,824,0001,002,0002,113,536
9Jun 17, 2026 10:5360,754513,266,862503,258,0001,002,0002,113,536