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 06:06Yuriy LyfenkoYuriy LyfenkoScore: 29,688Success
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 06:0629,650268,982,514244,093,0002,000,0002,326,528
2Jan 17, 2022 06:0629,660309,690,689246,179,99402,215,936
3Jan 17, 2022 06:0629,660267,691,574244,178,0002,001,0002,326,528
4Jan 17, 2022 06:0629,667305,473,970246,237,21902,224,128
5Jan 17, 2022 06:0629,667271,179,814244,233,0002,001,0002,326,528
6Jan 17, 2022 06:0629,668299,621,248246,244,55102,215,936
7Jan 17, 2022 06:0629,688269,857,532244,404,0002,003,0002,527,232
8Jan 17, 2022 06:0629,689270,154,941245,414,0001,001,0002,326,528
9Jan 17, 2022 06:0629,691276,441,377244,436,0002,003,0002,523,136
10Jan 17, 2022 06:0629,693271,039,016244,451,0002,003,0002,326,528
11Jan 17, 2022 06:0629,695273,197,408244,464,0002,003,0002,527,232
12Jan 17, 2022 06:0629,697277,151,777244,475,0002,012,0002,326,528