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 10, 2026 23:23Victor MerckléVictor MerckléScore: 3,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 23:233,87541,224,55930,980,0001,188,0002,117,632stderr
2Aug 10, 2026 23:233,90240,994,70031,253,0001,134,0002,117,632stderr
3Aug 10, 2026 23:233,90440,817,59731,287,0001,119,0002,117,632stderr
4Aug 10, 2026 23:233,90540,580,20031,249,0001,163,0002,117,632stderr
5Aug 10, 2026 23:233,92740,998,81431,405,0001,191,0002,117,632stderr
6Aug 10, 2026 23:233,93041,006,34031,495,0001,129,0002,117,632stderr
7Aug 10, 2026 23:233,94641,053,14831,637,0001,117,0002,117,632stderr
8Aug 10, 2026 23:233,94741,170,49231,587,0001,179,0002,117,632stderr
9Aug 10, 2026 23:234,02242,429,41432,156,0001,229,0002,117,632stderr