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 5, 2024 21:05Manuel PepeManuel PepeScore: 253,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 21:05253,6682,136,775,1042,019,465,00085,977,0002,330,624
2Nov 5, 2024 21:05253,6692,135,362,2612,002,530,000102,924,0002,330,624
3Nov 5, 2024 21:05253,6752,130,479,3942,011,567,00093,933,0002,494,464
4Nov 5, 2024 21:05253,7442,135,495,8232,024,110,00081,963,0002,506,752
5Nov 5, 2024 21:05253,7642,135,517,8612,043,267,00062,977,0002,502,656
6Nov 5, 2024 21:05253,7662,132,840,7802,021,327,00084,929,0002,326,528
7Nov 5, 2024 21:05253,7712,136,896,4052,020,329,00085,971,0002,330,624
8Nov 5, 2024 21:05253,7972,132,668,1292,023,574,00082,941,0002,510,848
9Nov 5, 2024 21:05254,0752,134,054,0382,010,881,00097,945,0002,326,528