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 listJun 13, 2021 21:19evgenikwtevgenikwtScore: 27,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 21:1927,372251,701,655226,188,0001,000,0002,519,040
2Jun 13, 2021 21:1927,401255,015,976226,430,0001,001,0002,519,040
3Jun 13, 2021 21:1927,413251,463,005226,530,0001,002,0002,379,776
4Jun 13, 2021 21:1927,433254,302,866226,696,000998,0002,375,680
5Jun 13, 2021 21:1927,469256,240,597225,995,0001,999,0002,260,992
6Jun 13, 2021 21:1927,680260,881,573227,744,0001,997,0002,519,040
7Jun 13, 2021 21:1927,707256,411,054227,965,0001,999,0002,256,896
8Jun 13, 2021 21:1927,709259,607,238229,984,00002,256,896
9Jun 13, 2021 21:1927,808256,672,425229,810,000999,0002,260,992
10Jun 13, 2021 21:1928,365306,264,920235,429,90602,244,608
11Jun 13, 2021 21:1928,682304,515,528238,057,36602,256,896
12Jun 13, 2021 21:1928,687303,005,982238,099,94102,248,704