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 listSep 7, 2021 15:53Andrey TsvetkovAndrey TsvetkovScore: 43,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 15:5443,783427,725,876363,399,99802,232,320
2Sep 7, 2021 15:5943,807424,869,131363,601,99802,236,416
3Sep 7, 2021 15:5943,813431,709,363363,648,87202,228,224
4Sep 7, 2021 15:5443,825430,691,455363,748,64302,236,416
5Sep 7, 2021 15:5343,838435,854,149363,853,48502,244,608
6Sep 7, 2021 15:5343,838433,635,186363,851,27102,236,416
7Sep 7, 2021 15:5343,857431,631,762364,009,42902,228,224
8Sep 7, 2021 15:5443,872426,577,045364,139,12002,232,320
9Sep 7, 2021 15:5943,874425,998,963364,153,76602,228,224