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 31, 2023 20:38vladnovikov93vladnovikov93Score: 60,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2023 20:3860,602577,790,752502,994,00002,269,184
2Aug 31, 2023 19:5260,621576,069,324503,157,04902,265,088
3Sep 1, 2023 20:5160,630565,744,011503,230,82002,265,088
4Sep 1, 2023 20:5160,631570,346,370503,233,97202,260,992
5Aug 31, 2023 19:5260,641589,806,699503,318,72002,260,992
6Aug 31, 2023 20:3860,643583,134,295503,335,63302,269,184
7Aug 31, 2023 19:5260,647583,704,099503,369,40802,269,184
8Sep 1, 2023 20:5160,649570,826,586503,388,35702,260,992
9Aug 31, 2023 20:3860,672590,759,002503,575,47502,265,088