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:47Victor MerckléVictor MerckléScore: 4,227Success
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:484,18743,116,73933,717,0001,037,0002,117,632stderr
2Aug 11, 2026 16:484,19143,151,13433,764,0001,027,0002,117,632stderr
3Aug 11, 2026 16:484,19243,206,66633,694,0001,104,0002,117,632stderr
4Aug 11, 2026 16:484,22644,555,04734,050,0001,031,0002,117,632stderr
5Aug 11, 2026 16:484,22743,479,67334,078,0001,014,0002,117,632stderr
6Aug 11, 2026 16:484,22943,506,87733,991,0001,114,0002,117,632stderr
7Aug 11, 2026 16:484,24343,622,76534,129,0001,092,0002,117,632stderr
8Aug 11, 2026 16:484,28043,754,56634,384,0001,140,0002,117,632stderr
9Aug 11, 2026 16:484,58646,475,12637,000,0001,067,0002,117,632stderr