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 18, 2026 15:16Kevin HeaveyKevin HeaveyScore: 3,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 15:253,62539,703,55828,935,0001,156,0002,113,536
2Jul 18, 2026 15:253,66139,962,66329,264,0001,123,0002,113,536
3Jul 18, 2026 15:253,72340,493,24629,858,0001,050,0002,113,536
4Jul 18, 2026 15:253,85442,202,00730,838,0001,154,0002,113,536
5Jul 18, 2026 15:253,85541,594,48630,860,0001,142,0002,113,536
6Jul 18, 2026 15:253,86541,749,98430,901,0001,179,0002,113,536
7Jul 18, 2026 15:253,88342,228,41931,006,0001,224,0002,113,536
8Jul 18, 2026 15:253,90842,609,13831,398,0001,044,0002,113,536
9Jul 18, 2026 15:253,92442,156,69031,431,0001,146,0002,113,536