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 listJun 7, 2024 11:47GraceGraceScore: 79,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 11:4779,328716,692,770658,426,51702,236,416
2Jun 7, 2024 11:4779,355744,693,080658,649,42302,244,608
3Jun 7, 2024 11:4779,370716,740,416658,774,32102,236,416
4Jun 7, 2024 11:4779,601716,279,316660,692,38002,244,608
5Jun 7, 2024 11:4779,601722,571,493660,688,58702,244,608
6Jun 7, 2024 11:4779,626724,822,822660,894,03802,244,608
7Jun 7, 2024 11:4779,712721,252,294661,612,12802,252,800
8Jun 7, 2024 11:4779,888735,398,234663,067,37702,236,416
9Jun 7, 2024 11:4779,919726,757,974663,326,71402,240,512
10Jun 7, 2024 11:4779,950729,305,349663,584,53002,240,512
11Jun 7, 2024 11:4779,992735,504,227663,930,42902,248,704
12Jun 7, 2024 11:4780,021719,163,921664,172,36502,244,608