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 listAug 27, 2026 11:18Victor MerckléVictor MerckléScore: 3,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 11:183,67339,582,28629,340,0001,148,0002,113,536
2Aug 27, 2026 11:183,67538,770,23129,368,0001,142,0002,113,536
3Aug 27, 2026 11:183,68638,800,88929,440,0001,162,0002,113,536
4Aug 27, 2026 11:183,70139,653,09029,558,0001,165,0002,113,536
5Aug 27, 2026 11:183,70139,736,91329,594,0001,126,0002,113,536
6Aug 27, 2026 11:183,72139,979,22929,752,0001,133,0002,113,536
7Aug 27, 2026 11:183,72339,469,28429,637,0001,268,0002,113,536
8Aug 27, 2026 11:183,75340,166,76029,982,0001,176,0002,113,536
9Aug 27, 2026 11:183,78439,819,97030,267,0001,145,0002,113,536