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 14:35Kevin HeaveyKevin HeaveyScore: 3,680Success
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 14:433,66740,392,21029,388,0001,053,0002,113,536
2Jul 22, 2026 14:433,66940,431,20629,406,0001,050,0002,113,536
3Jul 22, 2026 14:433,67040,427,35129,412,0001,053,0002,113,536
4Jul 22, 2026 14:433,67740,498,67129,476,0001,051,0002,113,536
5Jul 22, 2026 14:433,68040,452,11429,497,0001,049,0002,113,536
6Jul 22, 2026 14:433,68946,123,18229,570,0001,051,0002,113,536
7Jul 22, 2026 14:433,69144,367,73029,596,0001,041,0002,113,536
8Jul 22, 2026 14:433,70740,704,73929,724,0001,050,0002,113,536
9Jul 22, 2026 14:433,70946,168,72329,740,0001,047,0002,113,536