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 15:21Kevin HeaveyKevin HeaveyScore: 3,855Success
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 15:493,66340,176,04629,362,0001,047,0002,113,536
2Jul 17, 2026 15:493,67640,347,71929,465,0001,046,0002,113,536
3Jul 17, 2026 15:493,68240,433,08829,516,0001,050,0002,113,536
4Jul 17, 2026 15:493,69540,488,65329,626,0001,047,0002,113,536
5Jul 17, 2026 15:493,85541,744,65530,951,0001,046,0002,113,536
6Jul 17, 2026 15:493,93442,851,39431,612,0001,046,0002,113,536
7Jul 17, 2026 15:493,94642,524,83231,608,0001,148,0002,113,536
8Jul 17, 2026 15:493,96842,721,24631,898,0001,043,0002,113,536
9Jul 17, 2026 15:493,98342,936,48432,015,0001,045,0002,113,536