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 10, 2026 11:41Victor MerckléVictor MerckléScore: 4,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 11:414,51345,192,57036,399,0001,066,0002,113,536
2Jun 10, 2026 11:414,51745,113,18436,423,0001,069,0002,113,536
3Jun 10, 2026 11:414,52545,182,76436,487,0001,077,0002,113,536
4Jun 10, 2026 11:414,53045,199,26336,525,0001,082,0002,113,536
5Jun 10, 2026 11:414,53144,998,66936,596,0001,012,0002,113,536
6Jun 10, 2026 11:414,75348,399,41338,357,0001,101,0002,113,536
7Jun 10, 2026 11:414,75647,043,16738,473,0001,004,0002,113,536
8Jun 10, 2026 11:414,76047,144,16638,500,0001,009,0002,113,536
9Jun 10, 2026 11:414,76347,075,77238,502,0001,031,0002,113,536