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 15:10Yuriy LyfenkoYuriy LyfenkoScore: 27,230Success
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 15:1027,218249,947,273223,909,0001,999,0002,449,408
2Jan 17, 2022 15:1027,219250,658,706223,916,0001,999,0002,310,144
3Jan 17, 2022 15:1027,225251,302,124223,970,0001,999,0002,326,528
4Jan 17, 2022 15:1027,225251,860,003222,968,0002,999,0002,326,528
5Jan 17, 2022 15:1027,225251,930,841221,972,0003,999,0002,449,408
6Jan 17, 2022 15:1027,230252,489,221223,009,0003,000,0002,326,528
7Jan 17, 2022 15:1027,230253,254,433223,008,0003,000,0002,445,312
8Jan 17, 2022 15:1027,230253,425,660224,007,0002,000,0002,314,240
9Jan 17, 2022 15:1027,241255,438,002223,102,0003,001,0002,326,528
10Jan 17, 2022 15:1027,260286,434,261226,260,88202,252,800
11Jan 17, 2022 15:1027,278307,254,703226,406,01302,265,088
12Jan 17, 2022 15:1027,279289,205,281226,412,89502,256,896