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 22:49Victor MerckléVictor MerckléScore: 4,493Success
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 22:504,48444,874,52436,114,0001,108,0002,113,536
2Jun 24, 2026 22:504,48644,869,88536,147,0001,094,0002,113,536
3Jun 24, 2026 22:504,48944,877,68636,168,0001,096,0002,113,536
4Jun 24, 2026 22:504,49045,621,21336,192,0001,077,0002,113,536
5Jun 24, 2026 22:504,49344,972,36536,176,0001,118,0002,113,536
6Jun 24, 2026 22:504,49545,354,09636,195,0001,116,0002,113,536
7Jun 24, 2026 22:504,52145,164,74836,423,0001,103,0002,113,536
8Jun 24, 2026 22:504,66346,428,97737,679,0001,031,0002,113,536
9Jun 24, 2026 22:504,70646,700,18838,045,0001,018,0002,113,536