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 14, 2026 21:14Kevin HeaveyKevin HeaveyScore: 3,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:153,67140,151,04629,452,0001,024,0002,117,632
2Jul 14, 2026 21:153,69740,340,21929,659,0001,028,0002,117,632
3Jul 14, 2026 21:153,70540,280,38329,728,0001,025,0002,117,632
4Jul 14, 2026 21:153,71840,462,99329,835,0001,027,0002,117,632
5Jul 14, 2026 21:153,76340,884,07930,198,0001,039,0002,117,632
6Jul 14, 2026 21:153,78341,089,01630,357,0001,046,0002,117,632
7Jul 14, 2026 21:153,78941,054,72230,405,0001,046,0002,117,632
8Jul 14, 2026 21:153,78941,053,51930,404,0001,046,0002,117,632
9Jul 14, 2026 21:153,93549,717,33931,622,0001,044,0002,117,632