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 22, 2026 23:53Kevin HeaveyKevin HeaveyScore: 3,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 23:553,67840,418,18129,505,0001,025,0002,113,536
2Jul 22, 2026 23:553,70040,703,32929,692,0001,024,0002,113,536
3Jul 22, 2026 23:553,70040,705,49229,687,0001,025,0002,113,536
4Jul 22, 2026 23:553,71140,757,95929,777,0001,025,0002,113,536
5Jul 22, 2026 23:553,71841,400,92629,840,0001,025,0002,113,536
6Jul 22, 2026 23:553,73240,874,42629,957,0001,025,0002,113,536
7Jul 22, 2026 23:553,74140,938,49530,032,0001,026,0002,113,536
8Jul 22, 2026 23:5563,606537,797,188526,927,0001,003,0002,113,536
9Jul 22, 2026 23:5563,622537,948,391527,061,0001,005,0002,113,536