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 5, 2024 23:51Steve HanSteve HanScore: 9,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2024 23:519,727162,739,93280,734,05802,265,088
2May 5, 2024 23:519,776134,069,50981,141,34802,269,184
3May 5, 2024 23:519,777141,775,01681,147,38002,273,280
4May 5, 2024 23:519,781171,379,58881,180,83202,260,992
5May 5, 2024 23:519,782145,620,25481,194,48102,269,184
6May 5, 2024 23:519,785141,232,82681,213,70702,265,088
7May 5, 2024 23:529,789141,546,80181,251,01202,277,376
8May 5, 2024 23:5110,009161,226,79183,077,30702,277,376
9May 5, 2024 23:5110,015159,042,06883,126,43602,273,280
10May 5, 2024 23:5210,032147,824,49483,269,04102,269,184
11May 5, 2024 23:5210,058163,413,95283,479,49402,273,280
12May 5, 2024 23:5110,067164,903,41683,559,81302,265,088