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 13:51E SequeiraE SequeiraScore: 19,062Success
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 13:5119,043180,584,139156,058,0002,000,0002,289,664
2Nov 23, 2024 13:5119,053183,882,551157,142,0001,000,0002,469,888
3Nov 23, 2024 13:5119,055184,248,227157,159,0001,001,0002,289,664
4Nov 23, 2024 13:5119,059182,456,433156,187,0002,002,0002,289,664
5Nov 23, 2024 13:5119,062179,740,912156,215,0002,002,0002,473,984
6Nov 23, 2024 13:5119,070188,725,046156,279,0002,003,0002,465,792
7Nov 23, 2024 13:5119,072181,220,114156,297,0002,003,0002,465,792
8Nov 23, 2024 13:5119,085186,469,670158,402,00002,473,984
9Nov 23, 2024 13:5119,123187,386,159156,729,0001,996,0002,478,080