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 12, 2026 07:00Victor MerckléVictor MerckléScore: 4,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 07:014,60446,600,27837,141,0001,078,0002,117,632stderr
2Aug 12, 2026 07:014,60946,352,35137,155,0001,101,0002,117,632stderr
3Aug 12, 2026 07:014,61246,457,22537,239,0001,048,0002,117,632stderr
4Aug 12, 2026 07:014,61346,410,93837,270,0001,022,0002,117,632stderr
5Aug 12, 2026 07:014,61546,506,71637,145,0001,166,0002,117,632stderr
6Aug 12, 2026 07:014,61746,656,66637,229,0001,093,0002,117,632stderr
7Aug 12, 2026 07:014,63646,654,66237,457,0001,030,0002,117,632stderr
8Aug 12, 2026 07:014,76548,662,23838,453,0001,103,0002,117,632stderr
9Aug 12, 2026 07:014,78748,151,75738,686,0001,053,0002,117,632stderr