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 23, 2024 14:36E SequeiraE SequeiraScore: 13,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:3613,365135,514,878108,929,0001,998,0002,482,176
2Nov 23, 2024 14:3613,373141,076,427108,993,0001,999,0002,482,176
3Nov 23, 2024 14:3613,374138,210,866109,004,0002,000,0002,469,888
4Nov 23, 2024 14:3613,383133,269,838109,081,0002,001,0002,289,664
5Nov 23, 2024 14:3613,387137,102,066110,108,0001,000,0002,478,080
6Nov 23, 2024 14:3613,388137,696,845109,116,0002,002,0002,289,664
7Nov 23, 2024 14:3613,395134,641,847109,178,0002,003,0002,289,664
8Nov 23, 2024 14:3613,398134,374,414109,202,0002,003,0002,473,984
9Nov 23, 2024 14:3613,399140,046,106109,205,0002,003,0002,461,696