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 7, 2024 17:21spacecat8086spacecat8086Score: 1,827,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 17:211,824,21915,171,059,46415,072,044,00068,972,0002,289,664
2Nov 7, 2024 17:211,826,27915,191,846,91415,077,144,00080,968,0002,281,472
3Nov 7, 2024 17:211,827,06415,199,768,77515,103,659,00060,970,0002,281,472
4Nov 7, 2024 17:211,827,18015,195,698,27115,087,635,00077,961,0002,281,472
5Nov 7, 2024 17:211,827,18515,207,478,59215,101,660,00063,973,0002,281,472
6Nov 7, 2024 17:211,827,19215,200,353,66015,116,714,00048,979,0002,281,472
7Nov 7, 2024 17:211,827,25615,198,406,75115,102,246,00063,975,0002,281,472
8Nov 7, 2024 17:211,827,41415,197,015,16615,084,576,00082,964,0002,273,280
9Nov 7, 2024 17:211,828,77215,219,084,95815,104,843,00073,964,0002,293,760