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 listMay 13, 2024 00:09sliceteamsliceteamScore: 16,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2024 00:0916,477162,469,318133,761,0002,994,0002,371,584
2May 13, 2024 00:0916,521161,809,096136,126,0001,000,0002,367,488
3May 13, 2024 00:0916,532166,870,216135,211,0002,003,0002,412,544
4May 13, 2024 00:0916,600162,396,535136,783,000998,0002,387,968
5May 13, 2024 00:0916,616163,351,513136,917,000999,0002,408,448
6May 13, 2024 00:0916,617161,151,685136,920,000999,0002,379,776
7May 13, 2024 00:0916,699166,532,333138,600,00002,404,352
8May 13, 2024 00:0916,727164,558,082136,836,0001,997,0002,392,064
9May 13, 2024 00:0916,753163,886,771137,051,0002,000,0002,400,256
10May 13, 2024 00:0916,775202,140,675139,231,02302,265,088
11May 13, 2024 00:0917,040203,608,748141,433,90002,260,992
12May 13, 2024 00:0917,834202,167,279148,023,85102,277,376