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 listApr 10, 2024 07:21Matt StuchlikMatt StuchlikScore: 24,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2024 07:2122,186248,817,133184,142,72702,289,664
2Apr 10, 2024 07:2122,215246,094,040184,387,88202,293,760
3Apr 10, 2024 07:2122,232247,346,765184,524,30602,273,280
4Apr 10, 2024 07:2124,628228,123,250203,412,0001,002,0002,285,568
5Apr 10, 2024 07:2124,652236,951,795203,610,000998,0002,277,376
6Apr 10, 2024 07:2124,673235,472,204202,788,0001,997,0002,273,280
7Apr 10, 2024 07:2124,684229,070,238202,880,0001,998,0002,269,184
8Apr 10, 2024 07:2124,685228,560,203202,891,0001,998,0002,285,568
9Apr 10, 2024 07:2124,702227,938,087204,025,0001,000,0002,387,968
10Apr 10, 2024 07:2124,725227,869,254203,213,0002,002,0002,285,568
11Apr 10, 2024 07:2124,731229,590,463205,267,00002,285,568
12Apr 10, 2024 07:2124,743228,669,829204,363,0001,001,0002,285,568