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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:053,66740,200,65929,387,0001,050,0002,113,536
2Jul 18, 2026 18:053,67840,447,03229,483,0001,051,0002,113,536
3Jul 18, 2026 18:053,69640,520,65829,636,0001,048,0002,113,536
4Jul 18, 2026 18:053,70740,582,76829,722,0001,048,0002,113,536
5Jul 18, 2026 18:053,83141,595,88330,756,0001,047,0002,113,536
6Jul 18, 2026 18:053,88642,681,09131,210,0001,048,0002,113,536
7Jul 18, 2026 18:053,94442,509,03431,693,0001,048,0002,113,536
8Jul 18, 2026 18:053,98842,932,23232,060,0001,047,0002,113,536
9Jul 18, 2026 18:053,99343,525,24232,123,0001,026,0002,113,536