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 30, 2024 12:49Anoushk KharangateAnoushk KharangateScore: 45,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 12:4945,116432,841,317374,462,24602,170,880
2Apr 30, 2024 12:4845,119434,154,753374,489,44702,301,952
3Apr 30, 2024 12:4945,139444,432,403374,650,74502,301,952
4Apr 30, 2024 12:4845,157431,952,729374,800,12302,297,856
5Apr 30, 2024 12:4945,170441,712,296374,911,37402,170,880
6Apr 30, 2024 12:4945,179437,113,946374,984,82002,170,880
7Apr 30, 2024 12:4845,213433,965,448375,264,72902,297,856
8Apr 30, 2024 12:4945,243432,429,646375,517,98402,297,856
9Apr 30, 2024 12:4945,256441,140,989375,623,89602,170,880