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 13, 2025 13:14Paweł KruszecPaweł KruszecScore: 530,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2025 13:14529,7414,421,816,5604,325,885,00070,965,0002,383,872
2Jun 13, 2025 13:14529,8744,422,381,0484,333,985,00063,970,0002,285,568
3Jun 13, 2025 13:14529,8994,422,794,0674,336,187,00061,974,0002,273,280
4Jun 13, 2025 13:14530,1004,428,761,7724,331,861,00067,966,0002,273,280
5Jun 13, 2025 13:14530,1024,430,882,6394,320,882,00078,961,0002,273,280
6Jun 13, 2025 13:14530,3294,423,631,3014,339,766,00061,968,0002,273,280
7Jun 13, 2025 13:14532,1404,446,863,3994,343,799,00072,963,0002,273,280
8Jun 13, 2025 13:14532,4574,445,736,6594,358,426,00060,964,0002,273,280
9Jun 13, 2025 13:14536,5554,480,924,5264,382,445,00070,958,0002,273,280