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 24, 2026 20:40Victor MerckléVictor MerckléScore: 4,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:414,50645,715,00436,293,0001,110,0002,117,632stderr
2Jun 24, 2026 20:414,50945,037,05136,330,0001,100,0002,117,632stderr
3Jun 24, 2026 20:414,51445,090,34836,393,0001,077,0002,117,632stderr
4Jun 24, 2026 20:414,52045,364,07136,416,0001,105,0002,117,632stderr
5Jun 24, 2026 20:414,53345,246,27836,541,0001,091,0002,117,632stderr
6Jun 24, 2026 20:414,53747,086,60736,565,0001,100,0002,117,632stderr
7Jun 24, 2026 20:414,54045,678,31636,586,0001,100,0002,117,632stderr
8Jun 24, 2026 20:414,55345,837,26936,672,0001,120,0002,117,632stderr
9Jun 24, 2026 20:414,72846,864,57138,146,0001,099,0002,117,632stderr