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 23, 2026 02:24Kevin HeaveyKevin HeaveyScore: 4,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 02:254,04043,311,08731,470,0002,065,0002,113,536
2Jul 23, 2026 02:254,04943,333,01931,560,0002,047,0002,113,536
3Jul 23, 2026 02:254,05943,428,26931,623,0002,068,0002,113,536
4Jul 23, 2026 02:254,06843,545,61931,719,0002,050,0002,113,536
5Jul 23, 2026 02:254,07343,576,95031,747,0002,064,0002,113,536
6Jul 23, 2026 02:254,09743,738,41431,417,0002,596,0002,113,536
7Jul 23, 2026 02:254,13944,071,07532,308,0002,050,0002,113,536
8Jul 23, 2026 02:254,14644,186,49532,079,0002,336,0002,113,536
9Jul 23, 2026 02:254,16344,289,79832,364,0002,191,0002,113,536