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 11, 2024 13:17zielajzielajScore: 6,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 13:176,02272,869,26748,986,000999,0002,433,024
2Nov 11, 2024 13:176,06776,482,70549,348,0001,007,0002,273,280
3Nov 11, 2024 13:176,17676,061,99850,258,0001,005,0002,523,136
4Nov 11, 2024 13:176,84686,436,62155,822,000996,0002,428,928
5Nov 11, 2024 13:176,87376,119,08856,044,0001,000,0002,424,832
6Nov 11, 2024 13:176,93082,166,50257,523,00002,531,328