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 5, 2026 10:42chereshnya123chereshnya123Score: 245,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 10:44245,2432,044,739,4931,972,450,00063,074,0002,113,536
2Jun 5, 2026 10:44245,2682,046,209,4521,972,645,00063,084,0002,113,536
3Jun 5, 2026 10:44245,4302,046,105,7901,973,984,00063,086,0002,113,536
4Jun 5, 2026 10:44245,4372,046,300,5411,973,061,00064,069,0002,113,536
5Jun 5, 2026 10:44245,4442,046,348,1891,973,096,00064,097,0002,113,536
6Jun 5, 2026 10:44245,4622,046,573,6771,974,288,00063,048,0002,113,536
7Jun 5, 2026 10:44245,5512,048,151,4221,974,990,00063,084,0002,113,536
8Jun 5, 2026 10:44245,5652,047,553,1351,974,118,00064,076,0002,113,536
9Jun 5, 2026 10:44245,6112,047,635,5131,974,501,00064,078,0002,113,536