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 21:47Kevin HeaveyKevin HeaveyScore: 3,950Success
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 21:533,65440,164,49229,278,0001,054,0002,113,536
2Jul 17, 2026 21:533,69040,470,76929,568,0001,063,0002,113,536
3Jul 17, 2026 21:533,69440,590,49229,618,0001,048,0002,113,536
4Jul 17, 2026 21:533,91242,426,40631,433,0001,044,0002,113,536
5Jul 17, 2026 21:533,95043,890,85431,764,0001,024,0002,113,536
6Jul 17, 2026 21:533,96042,692,71431,825,0001,045,0002,113,536
7Jul 17, 2026 21:533,96442,722,97531,863,0001,043,0002,113,536
8Jul 17, 2026 21:533,97744,601,11131,970,0001,043,0002,113,536
9Jul 17, 2026 21:534,02444,779,72232,365,0001,041,0002,113,536