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 27, 2024 15:11Joad NacerJoad NacerScore: 13,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 15:1113,609180,741,045112,951,90902,281,472
2Apr 27, 2024 15:1113,746177,676,120114,090,01902,285,568
3Apr 27, 2024 15:1113,813140,088,295114,644,00002,519,040
4Apr 27, 2024 15:1113,835140,834,818112,836,0001,997,0002,260,992
5Apr 27, 2024 15:1113,862141,056,443113,056,0002,000,0002,285,568
6Apr 27, 2024 15:1113,894144,048,099113,316,0002,005,0002,523,136
7Apr 27, 2024 15:1113,928142,418,844115,599,00002,260,992
8Apr 27, 2024 15:1114,032144,053,196115,462,0001,004,0002,285,568
9Apr 27, 2024 15:1114,244180,492,748118,224,98002,256,896
10Apr 27, 2024 15:1114,255146,927,260116,313,0002,005,0002,285,568
11Apr 27, 2024 15:1114,565144,042,739118,889,0001,998,0002,252,800
12Apr 27, 2024 15:1116,016162,341,447131,932,000999,0002,510,848