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 listSep 21, 2023 21:48Ignas BagdonasIgnas BagdonasScore: 11,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 21:4811,551123,257,45692,877,0002,996,0002,273,280
2Sep 21, 2023 21:4811,552123,080,86293,883,0001,997,0002,273,280
3Sep 21, 2023 21:4811,558123,498,07593,930,0001,998,0002,371,584
4Sep 21, 2023 21:4811,559122,048,53194,940,000999,0002,273,280
5Sep 21, 2023 21:4811,609125,519,93595,354,0001,003,0002,273,280
6Sep 21, 2023 21:4811,611120,158,18996,374,00002,273,280
7Sep 21, 2023 21:4811,666120,048,68393,832,0002,994,0002,383,872
8Sep 21, 2023 21:4811,808126,930,06896,006,0002,000,0002,273,280
9Sep 21, 2023 21:4811,808125,110,59896,007,0002,000,0002,269,184
10Sep 21, 2023 21:4812,673164,883,767105,184,32402,289,664
11Sep 21, 2023 21:4812,840176,168,521106,573,79502,289,664
12Sep 21, 2023 21:4812,842163,346,404106,590,33102,293,760