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 07:14Victor MerckléVictor MerckléScore: 3,699Success
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 07:153,67838,921,87829,400,0001,134,0002,113,536
2Aug 27, 2026 07:153,68139,680,92429,406,0001,151,0002,113,536
3Aug 27, 2026 07:153,68238,768,94829,468,0001,100,0002,113,536
4Aug 27, 2026 07:153,69539,011,60429,532,0001,138,0002,113,536
5Aug 27, 2026 07:153,69938,989,21229,601,0001,102,0002,113,536
6Aug 27, 2026 07:153,71439,263,76429,741,0001,089,0002,113,536
7Aug 27, 2026 07:153,72639,132,68629,776,0001,151,0002,113,536
8Aug 27, 2026 07:153,72839,280,44129,844,0001,102,0002,113,536
9Aug 27, 2026 07:153,73639,418,79829,847,0001,169,0002,113,536