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 listJan 17, 2022 07:37Andrey TsvetkovAndrey TsvetkovScore: 32,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 07:3732,188335,927,146267,162,26602,224,128
2Jan 17, 2022 07:3832,190330,500,184267,175,28102,244,608
3Jan 17, 2022 07:3832,193331,528,160267,205,11302,240,512
4Jan 17, 2022 07:3832,196335,366,758267,228,81002,248,704
5Jan 17, 2022 07:3532,198334,032,428267,243,98102,232,320
6Jan 17, 2022 07:3532,198331,565,261267,240,40402,240,512
7Jan 17, 2022 07:3732,199334,516,485267,251,81102,232,320
8Jan 17, 2022 07:3732,209333,501,634267,331,94002,236,416
9Jan 17, 2022 07:3532,215341,789,831267,385,70202,236,416