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 11, 2026 20:39kuba1803kuba1803Score: 392,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 20:40391,6603,260,634,1483,180,708,00070,070,0002,113,536
2Jun 11, 2026 20:40391,6903,260,726,7153,180,961,00070,071,0002,113,536
3Jun 11, 2026 20:40391,7773,261,083,7303,180,601,00071,149,0002,113,536
4Jun 11, 2026 20:40392,1673,264,580,9933,183,867,00071,126,0002,113,536
5Jun 11, 2026 20:40392,6593,269,255,6863,185,805,00073,269,0002,113,536
6Jun 11, 2026 20:40392,7173,269,123,9423,188,492,00071,065,0002,113,536
7Jun 11, 2026 20:40393,0273,271,581,5873,192,056,00070,069,0002,113,536
8Jun 11, 2026 20:40393,4613,283,358,7403,190,646,00075,084,0002,113,536
9Jun 11, 2026 20:40394,5113,283,756,8793,203,241,00071,202,0002,113,536