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 listNov 10, 2024 16:05zielajzielajScore: 6,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 16:056,34379,333,27451,632,0001,012,0002,535,424
2Nov 10, 2024 16:056,36481,018,84351,828,000996,0002,535,424
3Nov 10, 2024 16:056,36980,219,90351,862,000997,0002,428,928
4Nov 10, 2024 16:056,37279,127,22850,893,0001,995,0002,428,928
5Nov 10, 2024 16:056,39072,219,57551,039,0002,001,0002,273,280
6Nov 10, 2024 16:056,42279,533,25751,294,0002,011,0002,535,424
7Nov 10, 2024 16:056,43378,873,01652,389,0001,007,0002,273,280
8Nov 10, 2024 16:056,54274,054,02753,292,0001,005,0002,424,832
9Nov 10, 2024 16:056,74573,211,63554,982,000999,0002,535,424
10Nov 10, 2024 16:057,71889,193,96163,060,0001,000,0002,531,328
11Nov 10, 2024 16:057,75785,778,02064,384,00002,269,184
12Nov 10, 2024 16:057,78295,941,39364,588,00002,269,184