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 listOct 7, 2024 21:11Joad NacerJoad NacerScore: 8,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 21:117,20681,054,32958,815,000996,0002,424,832
2Oct 7, 2024 21:117,36784,813,47260,141,0001,002,0002,428,928
3Oct 7, 2024 21:117,38386,949,08860,271,0001,004,0002,428,928
4Oct 7, 2024 21:118,08388,381,82966,088,0001,001,0002,531,328
5Oct 7, 2024 21:118,29299,362,46968,827,00002,269,184
6Oct 7, 2024 21:118,31398,138,06667,995,000999,0002,420,736