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 11:01chereshnya123chereshnya123Score: 158,154Success
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 11:02157,7271,318,300,4021,246,066,00063,071,0002,113,536
2Jun 5, 2026 11:02157,8451,319,304,9111,246,044,00064,074,0002,113,536
3Jun 5, 2026 11:02158,0351,320,799,9511,245,602,00066,089,0002,113,536
4Jun 5, 2026 11:02158,0821,321,380,5301,245,996,00066,091,0002,113,536
5Jun 5, 2026 11:02158,1541,321,950,6081,249,582,00063,097,0002,113,536
6Jun 5, 2026 11:02158,3481,323,432,8391,250,193,00064,103,0002,113,536
7Jun 5, 2026 11:02158,5131,326,419,2551,250,571,00065,088,0002,113,536
8Jun 5, 2026 11:02159,5731,333,583,8431,260,361,00064,097,0002,113,536
9Jun 5, 2026 11:02167,4721,399,141,5531,326,925,00063,097,0002,113,536