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 5, 2021 09:43Sergey StreminSergey StreminScore: 29,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2021 09:4329,531330,635,480245,111,19802,220,032
2Sep 5, 2021 09:4329,591314,602,254245,607,30502,215,936
3Sep 5, 2021 09:4329,611273,161,593243,770,0001,998,0002,367,488
4Sep 5, 2021 09:4329,646307,788,632246,061,59602,228,224
5Sep 5, 2021 09:4329,668269,310,083244,246,0002,002,0002,281,472
6Sep 5, 2021 09:4329,694269,524,735246,458,00002,371,584
7Sep 5, 2021 09:4329,719272,627,403245,670,000998,0002,281,472
8Sep 5, 2021 09:4329,725272,786,763244,723,0001,997,0002,281,472
9Sep 5, 2021 09:4329,727274,474,460245,734,000998,0002,281,472
10Sep 5, 2021 09:4329,730276,561,604245,762,000999,0002,375,680
11Sep 5, 2021 09:4329,731271,636,969245,766,000999,0002,375,680
12Sep 5, 2021 09:4329,750274,153,277245,929,000999,0002,379,776