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 listMay 24, 2026 17:16Victor MerckléVictor MerckléScore: 4,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 17:174,60947,555,14037,192,0001,064,0002,113,536
2May 24, 2026 17:174,61546,936,78337,229,0001,079,0002,113,536
3May 24, 2026 17:174,61648,023,40437,277,0001,039,0002,113,536
4May 24, 2026 17:174,62447,181,25037,355,0001,031,0002,113,536
5May 24, 2026 17:174,62647,839,23537,335,0001,068,0002,113,536
6May 24, 2026 17:174,63848,027,88837,436,0001,064,0002,113,536
7May 24, 2026 17:174,64047,071,03337,486,0001,029,0002,113,536
8May 24, 2026 17:174,83447,984,09739,088,0001,041,0002,113,536
9May 24, 2026 17:174,83548,637,77639,104,0001,028,0002,113,536