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 27, 2022 18:02apuxbtapuxbtScore: 255,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 18:02254,1448,764,589,9902,109,391,48902,211,840
2Nov 27, 2022 18:02255,1949,175,308,5202,118,111,34002,179,072
3Nov 27, 2022 18:02255,6399,313,122,5662,121,807,06002,232,320