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:57ZOTTIGZOTTIGScore: 85,247Success
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:5784,422725,869,715638,728,00061,973,0002,326,528
2Nov 11, 2024 13:5784,541734,500,616646,714,00054,975,0002,326,528
3Nov 11, 2024 13:5784,622732,166,218646,335,00056,029,0002,326,528
4Nov 11, 2024 13:5784,643736,132,353648,575,00053,964,0002,326,528
5Nov 11, 2024 13:5785,247736,582,980646,587,00060,961,0002,326,528
6Nov 11, 2024 13:5785,401734,177,616653,840,00054,986,0002,486,272
7Nov 11, 2024 13:5785,519731,884,064662,817,00046,987,0002,326,528
8Nov 11, 2024 13:5785,634739,783,317657,778,00052,982,0002,473,984
9Nov 11, 2024 13:5785,816743,644,059653,251,00059,022,0002,330,624