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 listJun 24, 2026 23:52Victor MerckléVictor MerckléScore: 4,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:534,17142,254,66733,501,0001,125,0002,113,536
2Jun 24, 2026 23:534,17542,614,46433,579,0001,080,0002,113,536
3Jun 24, 2026 23:534,19042,287,18333,668,0001,109,0002,113,536
4Jun 24, 2026 23:534,19342,449,82533,705,0001,101,0002,113,536
5Jun 24, 2026 23:534,19842,744,04733,771,0001,080,0002,113,536
6Jun 24, 2026 23:534,19942,395,01233,826,0001,030,0002,113,536
7Jun 24, 2026 23:534,21242,599,79733,863,0001,102,0002,113,536
8Jun 24, 2026 23:534,32143,508,21434,749,0001,119,0002,113,536
9Jun 24, 2026 23:534,33943,731,43534,904,0001,113,0002,113,536