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 11, 2026 16:26Victor MerckléVictor MerckléScore: 8,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:278,34077,642,57964,080,0005,149,0002,117,632stderr
2Aug 11, 2026 16:278,42078,239,55264,720,0005,168,0002,117,632stderr
3Aug 11, 2026 16:278,44378,464,71864,444,0005,640,0002,117,632stderr
4Aug 11, 2026 16:278,45478,728,18164,887,0005,282,0002,117,632stderr
5Aug 11, 2026 16:278,46578,668,79165,091,0005,171,0002,117,632stderr
6Aug 11, 2026 16:278,47878,814,28264,749,0005,624,0002,117,632stderr
7Aug 11, 2026 16:278,49478,922,06664,899,0005,607,0002,117,632stderr
8Aug 11, 2026 16:278,64380,194,87866,242,0005,496,0002,117,632stderr
9Aug 11, 2026 16:278,66080,308,78466,408,0005,476,0002,117,632stderr