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:49E 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:5013,362140,595,897108,907,0001,998,0002,289,664
2Nov 23, 2024 14:5013,363136,685,610108,915,0001,998,0002,465,792
3Nov 23, 2024 14:4913,383136,730,557109,075,0002,001,0002,469,888
4Nov 23, 2024 14:4913,387138,459,567109,108,0002,001,0002,461,696
5Nov 23, 2024 14:4913,388137,969,735109,117,0002,002,0002,289,664
6Nov 23, 2024 14:5013,388140,920,420109,116,0002,002,0002,289,664