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 24, 2026 18:23Kevin HeaveyKevin HeaveyScore: 3,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 18:283,81241,441,90729,246,0002,396,0002,183,168
2Jul 24, 2026 18:283,82041,451,76730,428,0001,281,0002,129,920
3Jul 24, 2026 18:283,91242,190,12030,071,0002,402,0002,183,168
4Jul 24, 2026 18:283,92042,341,89030,138,0002,400,0002,183,168
5Jul 24, 2026 18:283,92842,350,46531,315,0001,289,0002,129,920
6Jul 24, 2026 18:283,95142,535,79331,503,0001,294,0002,129,920
7Jul 24, 2026 18:283,96642,661,81231,604,0001,319,0002,129,920
8Jul 24, 2026 18:284,07565,877,68931,715,0002,114,0002,134,016
9Jul 24, 2026 18:284,26361,180,66233,319,0002,064,0002,134,016