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 17, 2026 18:36Kevin HeaveyKevin HeaveyScore: 3,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 18:383,61039,738,71328,917,0001,047,0002,117,632
2Jul 17, 2026 18:383,63539,926,02729,130,0001,048,0002,117,632
3Jul 17, 2026 18:383,79741,339,01630,479,0001,040,0002,117,632
4Jul 17, 2026 18:383,85741,749,90930,777,0001,237,0002,117,632
5Jul 17, 2026 18:383,92542,383,58931,539,0001,039,0002,117,632
6Jul 17, 2026 18:383,92642,362,89631,546,0001,048,0002,117,632
7Jul 17, 2026 18:383,93743,145,75931,663,0001,018,0002,117,632
8Jul 17, 2026 18:383,94242,481,12131,679,0001,041,0002,117,632
9Jul 17, 2026 18:383,96242,651,62831,849,0001,040,0002,117,632