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 listApr 29, 2024 08:42Anoushk KharangateAnoushk KharangateScore: 50,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 08:4150,636478,121,321420,275,07102,179,072
2Apr 29, 2024 08:4150,637479,348,151420,282,96502,174,976
3Apr 29, 2024 08:4150,642489,392,976420,327,12302,293,760
4Apr 29, 2024 08:4150,654481,262,087420,430,10902,170,880
5Apr 29, 2024 08:4250,660481,361,086420,481,41902,297,856
6Apr 29, 2024 08:1050,673486,473,787420,587,08802,170,880
7Apr 29, 2024 08:1050,679483,510,776420,632,79602,174,976
8Apr 29, 2024 08:4150,680485,235,636420,645,17202,293,760
9Apr 29, 2024 08:4250,696489,110,543420,779,88902,174,976
10Apr 29, 2024 08:1050,729480,243,169421,054,01302,297,856
11Apr 29, 2024 08:4250,740491,714,816421,144,39502,252,800
12Apr 29, 2024 08:4150,796479,420,014421,604,40502,174,976