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 listDec 29, 2022 20:31Alexander KimAlexander KimScore: 23,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 20:3123,276215,110,112191,187,0002,001,0002,326,528
2Dec 29, 2022 20:3123,283219,202,520191,246,0002,002,0002,326,528
3Dec 29, 2022 20:3123,286215,990,803189,272,0004,005,0002,326,528
4Dec 29, 2022 20:3123,289217,092,159191,298,0002,003,0002,457,600
5Dec 29, 2022 20:3123,292218,449,299190,319,0003,005,0002,465,792
6Dec 29, 2022 20:3123,294213,662,336191,334,0002,003,0002,457,600
7Dec 29, 2022 20:3123,294221,863,483193,343,00002,465,792
8Dec 29, 2022 20:3123,323226,761,625190,570,0003,009,0002,326,528
9Dec 29, 2022 20:3123,343244,782,490193,749,22602,293,760
10Dec 29, 2022 20:3123,347250,645,968193,778,72402,297,856
11Dec 29, 2022 20:3123,348251,354,412193,785,46602,289,664
12Dec 29, 2022 20:3123,373222,000,691191,000,0003,000,0002,326,528