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 25, 2026 20:33Victor MerckléVictor MerckléScore: 4,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 20:344,17542,601,92033,546,0001,112,0002,113,536
2Jun 25, 2026 20:344,17542,165,90233,558,0001,102,0002,113,536
3Jun 25, 2026 20:344,17642,280,27533,543,0001,121,0002,113,536
4Jun 25, 2026 20:344,17742,260,02633,582,0001,090,0002,113,536
5Jun 25, 2026 20:344,19442,310,67333,733,0001,083,0002,113,536
6Jun 25, 2026 20:344,20342,455,07733,874,0001,016,0002,113,536
7Jun 25, 2026 20:344,33443,448,97134,882,0001,093,0002,113,536
8Jun 25, 2026 20:344,47944,678,76636,155,0001,024,0002,113,536
9Jun 25, 2026 20:344,56445,774,73736,863,0001,021,0002,113,536