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 6, 2026 08:03Kevin HeaveyKevin HeaveyScore: 4,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 08:054,43346,350,48235,632,0001,165,0002,117,632
2Jul 6, 2026 08:054,45146,538,98035,711,0001,235,0002,117,632
3Jul 6, 2026 08:054,51447,111,05036,230,0001,243,0002,117,632
4Jul 6, 2026 08:054,51646,996,49836,255,0001,229,0002,117,632
5Jul 6, 2026 08:054,58847,667,60036,860,0001,223,0002,117,632
6Jul 6, 2026 08:054,61447,853,36737,119,0001,182,0002,117,632
7Jul 6, 2026 08:054,62047,873,86637,181,0001,173,0002,117,632
8Jul 6, 2026 08:054,65648,154,61037,432,0001,215,0002,117,632
9Jul 6, 2026 08:054,95750,659,97839,944,0001,202,0002,117,632