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 listJul 17, 2026 19:23Kevin HeaveyKevin HeaveyScore: 3,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 19:453,69840,533,11829,648,0001,046,0002,113,536
2Jul 17, 2026 19:453,70040,528,21229,665,0001,046,0002,113,536
3Jul 17, 2026 19:453,70641,730,68829,721,0001,047,0002,113,536
4Jul 17, 2026 19:453,72140,910,91529,840,0001,045,0002,113,536
5Jul 17, 2026 19:453,84941,835,66530,781,0001,168,0002,113,536
6Jul 17, 2026 19:453,98242,890,09932,029,0001,022,0002,113,536
7Jul 17, 2026 19:453,99243,224,31832,092,0001,043,0002,113,536
8Jul 17, 2026 19:454,02643,320,72432,226,0001,197,0002,113,536
9Jul 17, 2026 19:454,03043,389,50932,414,0001,042,0002,113,536