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 listNov 23, 2024 15:02E SequeiraE SequeiraScore: 13,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:5613,313135,590,790109,490,0001,004,0002,289,664
2Nov 23, 2024 14:5613,346139,607,508109,778,000997,0002,465,792
3Nov 23, 2024 14:5613,347135,602,702108,784,0001,996,0002,289,664
4Nov 23, 2024 14:5613,348141,510,758108,789,0001,996,0002,289,664
5Nov 23, 2024 14:5613,348142,469,156108,794,0001,996,0002,289,664
6Nov 23, 2024 15:0213,352136,920,175109,823,000998,0002,289,664
7Nov 23, 2024 14:5613,359137,459,488109,885,000998,0002,473,984
8Nov 23, 2024 14:5613,359141,038,929108,884,0001,997,0002,473,984
9Nov 23, 2024 15:0213,359137,402,576108,879,0001,997,0002,473,984
10Nov 23, 2024 14:5613,361138,541,259108,899,0001,998,0002,289,664
11Nov 23, 2024 14:5613,364137,598,393108,920,0001,998,0002,289,664
12Nov 23, 2024 15:0213,383138,685,494109,079,0002,001,0002,289,664